{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J6RTS4XNTXC2A4HOYA3WQQR5ZT","short_pith_number":"pith:J6RTS4XN","schema_version":"1.0","canonical_sha256":"4fa33972ed9dc5a070eec03768423dccff42aafc445a1cb794b81f9cee5f8124","source":{"kind":"arxiv","id":"2003.09642","version":2},"attestation_state":"computed","paper":{"title":"An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.DM","authors_text":"Julia M\\\"annecke, Michael A. Bekos, Michael Kaufmann, Mirco Haug","submitted_at":"2020-03-21T12:17:25Z","abstract_excerpt":"We present a prototype online system to automate the procedure of computing different types of linear layouts of graphs under different user-specific constraints. Currently, four different types of linear layouts are supported: stack, queue, rique and deque, as well as, any mixture of them.\n  The system consists of two main components; the client and the server sides. The client side is built upon an easy-to-use editor, which supports basic interaction with graphs, enriched with several additional features to allow the user to define and further constraint the linear layout to be computed. The"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.09642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-03-21T12:17:25Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"0b87347050efae3136196c3386add049f251b843185af2082a5a3dcb8c7addb2","abstract_canon_sha256":"3840c0251642f009b5006559b0c8f49313bf9185e79c87933accb6774af4686f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:05.803235Z","signature_b64":"Ci0aI8gc63203brZYHxgYEdQe0ueU+WqksUuzx7IW74HfjBQ7hkYlENppYOsm8B0VBCqgXGIApj+hfjfDsK0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fa33972ed9dc5a070eec03768423dccff42aafc445a1cb794b81f9cee5f8124","last_reissued_at":"2026-07-05T05:52:05.802701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:05.802701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.DM","authors_text":"Julia M\\\"annecke, Michael A. Bekos, Michael Kaufmann, Mirco Haug","submitted_at":"2020-03-21T12:17:25Z","abstract_excerpt":"We present a prototype online system to automate the procedure of computing different types of linear layouts of graphs under different user-specific constraints. Currently, four different types of linear layouts are supported: stack, queue, rique and deque, as well as, any mixture of them.\n  The system consists of two main components; the client and the server sides. The client side is built upon an easy-to-use editor, which supports basic interaction with graphs, enriched with several additional features to allow the user to define and further constraint the linear layout to be computed. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.09642","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.09642/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.09642","created_at":"2026-07-05T05:52:05.802763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.09642v2","created_at":"2026-07-05T05:52:05.802763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.09642","created_at":"2026-07-05T05:52:05.802763+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6RTS4XNTXC2","created_at":"2026-07-05T05:52:05.802763+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6RTS4XNTXC2A4HO","created_at":"2026-07-05T05:52:05.802763+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6RTS4XN","created_at":"2026-07-05T05:52:05.802763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT","json":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT.json","graph_json":"https://pith.science/api/pith-number/J6RTS4XNTXC2A4HOYA3WQQR5ZT/graph.json","events_json":"https://pith.science/api/pith-number/J6RTS4XNTXC2A4HOYA3WQQR5ZT/events.json","paper":"https://pith.science/paper/J6RTS4XN"},"agent_actions":{"view_html":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT","download_json":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT.json","view_paper":"https://pith.science/paper/J6RTS4XN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.09642&json=true","fetch_graph":"https://pith.science/api/pith-number/J6RTS4XNTXC2A4HOYA3WQQR5ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/J6RTS4XNTXC2A4HOYA3WQQR5ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT/action/storage_attestation","attest_author":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT/action/author_attestation","sign_citation":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT/action/citation_signature","submit_replication":"https://pith.science/pith/J6RTS4XNTXC2A4HOYA3WQQR5ZT/action/replication_record"}},"created_at":"2026-07-05T05:52:05.802763+00:00","updated_at":"2026-07-05T05:52:05.802763+00:00"}