Abstract: A system and related methods for running an application in an extended browser session with a limited scope of access is disclosed. The system is programmed to determine the scope of access to an ontology for an application generating a graphical output as a webpage in a kiosk mode, where the ontology has object types and link types instantiated from underlying datasets. The scope of access depends on the user account running the application and excludes operations leading to writebacks to the underlying datasets. The system is programmed to continuously supply a limited-scope token with a future expiration date that represents currently determined scope of access, which is to be used as a cookie for the application. For each Web request that includes such a cookie for access to the ontology, the system is programmed to allow access according to the scope of access represented by the cookie.

Abstract: Systems and methods for code rebasing/conflict resolution are provided. For example, method for rebasing a software project is comprises: determining a set of changes between a branch version and a main version of the software project; identifying, from the set of changes, a conflict between the branch version and the main version; generating a user interface comprising at least one of: a first graphical representation of the conflict as implemented in the main version; or a second graphical representation of the conflict as implemented in the branch version; receiving, via the user interface, user input indicating a resolution for the presented conflict; and updating the branch version of the software project according to the indicated resolution, thereby resolving the conflict to facilitate merging of the branch of the software project onto the main version of the software project; wherein the method is performed using one or more processors.

Abstract: A system and related methods for running an application in an extended browser session with a limited scope of access is disclosed. The system is programmed to determine the scope of access to an ontology for an application generating a graphical output as a webpage in a kiosk mode, where the ontology has object types and link types instantiated from underlying datasets. The scope of access depends on the user account running the application and excludes operations leading to writebacks to the underlying datasets. The system is programmed to continuously supply a limited-scope token with a future expiration date that represents currently determined scope of access, which is to be used as a cookie for the application. For each Web request that includes such a cookie for access to the ontology, the system is programmed to allow access according to the scope of access represented by the cookie.

Abstract: Disclosed herein are systems and techniques for centralized data retention and deletion. Data can be ingested from multiple external data sources and saved internally for use to process data modification (e.g., deletion) requests via a data processing pipeline, which may apply eligibility checks and modification logic to determine the appropriate modifications to the relevant data items to comply with the data modification request. Various user interfaces may be generated to provide a user with oversight of the data processing pipeline and the data modifications. The user may review and trigger the modification of data stored at the external data sources and/or internally.

Abstract: Disclosed herein are systems and techniques for centralized data retention and deletion. Data can be ingested from multiple external data sources and saved internally for use to process data modification (e.g., deletion) requests via a data processing pipeline, which may apply eligibility checks and modification logic to determine the appropriate modifications to the relevant data items to comply with the data modification request. Various user interfaces may be generated to provide a user with oversight of the data processing pipeline and the data modifications. The user may review and trigger the modification of data stored at the external data sources and/or internally.

Abstract: A user interface generation system and associated methods are disclosed for displaying nodes of a computer program or computation. The system may determine an ordering and position of elements for display. The ordering can include determining a first ancestor branch of a node associated with a stage with an earliest start time among the start times associated with the stages of a plurality of ancestor branches. This first ancestor branch may be designated as first in the ordering. A second ancestor branch may be determined from among the remaining ancestor branches having an stage with an earliest start time among the start times associated with the remaining stages. This second ancestor branch can be designated as second in the ordering.

Abstract: A user interface generation system and associated methods are disclosed for displaying nodes of a computer program or computation. The system may determine an ordering and position of elements for display. The ordering can include determining a first ancestor branch of a node associated with a stage with an earliest start time among the start times associated with the stages of a plurality of ancestor branches. This first ancestor branch may be designated as first in the ordering. A second ancestor branch may be determined from among the remaining ancestor branches having an stage with an earliest start time among the start times associated with the remaining stages. This second ancestor branch can be designated as second in the ordering.

Abstract: A user interface generation system and associated methods are disclosed for displaying nodes of a computer program or computation. The system may determine an ordering and position of elements for display. The ordering can include determining a first ancestor branch of a node associated with a stage with an earliest start time among the start times associated with the stages of a plurality of ancestor branches. This first ancestor branch may be designated as first in the ordering. A second ancestor branch may be determined from among the remaining ancestor branches having an stage with an earliest start time among the start times associated with the remaining stages. This second ancestor branch can be designated as second in the ordering.

Abstract: Methods, systems, and computer-readable media described herein may include: obtaining first data from a first datastore managed by a first entity, the first data comprising a first status of a first task of a first subsidiary workflow that is part of an integrated workflow; integrating the first data into a second datastore managed by a second entity that manages the integrated workflow, with an integration layer; generating a graphical user interface to present an interactive graphical object that displays the integrated first data and the integrated workflow to a user; receiving one or more updates from the user to the integrated first data, where the one or more updates are based on one or more graphical user interactions with the integrated first data; identifying a change to a portion of the first data; and writing the change in the first datastore using the integration layer interface.