{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HRG5XY4FYZWAMW6FI7NWIZ2HSC","short_pith_number":"pith:HRG5XY4F","schema_version":"1.0","canonical_sha256":"3c4ddbe385c66c065bc547db6467479083d9ae20e139efda1f32b04e777b6e6d","source":{"kind":"arxiv","id":"2508.16319","version":1},"attestation_state":"computed","paper":{"title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Robert Ganian, Simon D. Fink, Thomas Depian, Vaishali Surianarayanan","submitted_at":"2025-08-22T11:58:56Z","abstract_excerpt":"In spite of the extensive study of stack and queue layouts, many fundamental questions remain open concerning the complexity-theoretic frontiers for computing stack and queue layouts. A stack (resp. queue) layout places vertices along a line and assigns edges to pages so that no two edges on the same page are crossing (resp. nested). We provide three new algorithms which together substantially expand our understanding of these problems:\n  (1) A fixed-parameter algorithm for computing minimum-page stack and queue layouts w.r.t. the vertex integrity of an n-vertex graph G. This result is motivat"},"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":"2508.16319","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-22T11:58:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"330b01729b8d0b316bc0d842a413a3396c0ca03194bb48ab9827c0df23ed6203","abstract_canon_sha256":"6c4e2d40c0a1e2a00b769a0f59ebbd618f9a398cba8be2eaed0901ff82ae6742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:45.995075Z","signature_b64":"voJy41iNiiSNaTdvNEaDid/CEnt6686+uH0JSwc16Wr8DvJ8Sh0f7ROyDyZwnAZm4OXdlRSJjEwuXYOApMiyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c4ddbe385c66c065bc547db6467479083d9ae20e139efda1f32b04e777b6e6d","last_reissued_at":"2026-07-05T11:57:45.994589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:45.994589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Robert Ganian, Simon D. Fink, Thomas Depian, Vaishali Surianarayanan","submitted_at":"2025-08-22T11:58:56Z","abstract_excerpt":"In spite of the extensive study of stack and queue layouts, many fundamental questions remain open concerning the complexity-theoretic frontiers for computing stack and queue layouts. A stack (resp. queue) layout places vertices along a line and assigns edges to pages so that no two edges on the same page are crossing (resp. nested). We provide three new algorithms which together substantially expand our understanding of these problems:\n  (1) A fixed-parameter algorithm for computing minimum-page stack and queue layouts w.r.t. the vertex integrity of an n-vertex graph G. This result is motivat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16319","kind":"arxiv","version":1},"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/2508.16319/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":"2508.16319","created_at":"2026-07-05T11:57:45.994651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16319v1","created_at":"2026-07-05T11:57:45.994651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16319","created_at":"2026-07-05T11:57:45.994651+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRG5XY4FYZWA","created_at":"2026-07-05T11:57:45.994651+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRG5XY4FYZWAMW6F","created_at":"2026-07-05T11:57:45.994651+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRG5XY4F","created_at":"2026-07-05T11:57:45.994651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20331","citing_title":"Computing Twin-Width via Treedepth and Vertex Integrity","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC","json":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC.json","graph_json":"https://pith.science/api/pith-number/HRG5XY4FYZWAMW6FI7NWIZ2HSC/graph.json","events_json":"https://pith.science/api/pith-number/HRG5XY4FYZWAMW6FI7NWIZ2HSC/events.json","paper":"https://pith.science/paper/HRG5XY4F"},"agent_actions":{"view_html":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC","download_json":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC.json","view_paper":"https://pith.science/paper/HRG5XY4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16319&json=true","fetch_graph":"https://pith.science/api/pith-number/HRG5XY4FYZWAMW6FI7NWIZ2HSC/graph.json","fetch_events":"https://pith.science/api/pith-number/HRG5XY4FYZWAMW6FI7NWIZ2HSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/action/storage_attestation","attest_author":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/action/author_attestation","sign_citation":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/action/citation_signature","submit_replication":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/action/replication_record"}},"created_at":"2026-07-05T11:57:45.994651+00:00","updated_at":"2026-07-05T11:57:45.994651+00:00"}