{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HRG5XY4FYZWAMW6FI7NWIZ2HSC","short_pith_number":"pith:HRG5XY4F","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"},"canonical_sha256":"3c4ddbe385c66c065bc547db6467479083d9ae20e139efda1f32b04e777b6e6d","source":{"kind":"arxiv","id":"2508.16319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.16319","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.16319v1","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16319","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"HRG5XY4FYZWA","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"pith_short_16","alias_value":"HRG5XY4FYZWAMW6F","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"pith_short_8","alias_value":"HRG5XY4F","created_at":"2026-07-05T11:57:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HRG5XY4FYZWAMW6FI7NWIZ2HSC","target":"record","payload":{"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"},"canonical_sha256":"3c4ddbe385c66c065bc547db6467479083d9ae20e139efda1f32b04e777b6e6d","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"},"source_kind":"arxiv","source_id":"2508.16319","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSbjKpuRbZI0tZhhBrAzIZiGZC2pZWe5Ni7FySrB7CtJ6yX8lL5/NDGeVX5FVrbO0Njx61B8ERDBeKRnPt0nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:18:16.101162Z"},"content_sha256":"2deeb2561137d63eddbad8ca96448578aa9d2e69083cd2d31042e820bc5ffa7c","schema_version":"1.0","event_id":"sha256:2deeb2561137d63eddbad8ca96448578aa9d2e69083cd2d31042e820bc5ffa7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HRG5XY4FYZWAMW6FI7NWIZ2HSC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lu/N593GayLzR+jym6BtJesRr1OkQxY/eMroXX3OahLXhBfuF8R8KonID95s9Vk9uasticVrEvBg/g4kWio6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:18:16.101683Z"},"content_sha256":"dfc29b7276c7e371ef31fbb52c6fd67a56530e801e7812749660504fc4543aa0","schema_version":"1.0","event_id":"sha256:dfc29b7276c7e371ef31fbb52c6fd67a56530e801e7812749660504fc4543aa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/bundle.json","state_url":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T20:18:16Z","links":{"resolver":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC","bundle":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/bundle.json","state":"https://pith.science/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRG5XY4FYZWAMW6FI7NWIZ2HSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HRG5XY4FYZWAMW6FI7NWIZ2HSC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6c4e2d40c0a1e2a00b769a0f59ebbd618f9a398cba8be2eaed0901ff82ae6742","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-22T11:58:56Z","title_canon_sha256":"330b01729b8d0b316bc0d842a413a3396c0ca03194bb48ab9827c0df23ed6203"},"schema_version":"1.0","source":{"id":"2508.16319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.16319","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.16319v1","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16319","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"HRG5XY4FYZWA","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"pith_short_16","alias_value":"HRG5XY4FYZWAMW6F","created_at":"2026-07-05T11:57:45Z"},{"alias_kind":"pith_short_8","alias_value":"HRG5XY4F","created_at":"2026-07-05T11:57:45Z"}],"graph_snapshots":[{"event_id":"sha256:dfc29b7276c7e371ef31fbb52c6fd67a56530e801e7812749660504fc4543aa0","target":"graph","created_at":"2026-07-05T11:57:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.16319/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Robert Ganian, Simon D. Fink, Thomas Depian, Vaishali Surianarayanan","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16319","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2deeb2561137d63eddbad8ca96448578aa9d2e69083cd2d31042e820bc5ffa7c","target":"record","created_at":"2026-07-05T11:57:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6c4e2d40c0a1e2a00b769a0f59ebbd618f9a398cba8be2eaed0901ff82ae6742","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-22T11:58:56Z","title_canon_sha256":"330b01729b8d0b316bc0d842a413a3396c0ca03194bb48ab9827c0df23ed6203"},"schema_version":"1.0","source":{"id":"2508.16319","kind":"arxiv","version":1}},"canonical_sha256":"3c4ddbe385c66c065bc547db6467479083d9ae20e139efda1f32b04e777b6e6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c4ddbe385c66c065bc547db6467479083d9ae20e139efda1f32b04e777b6e6d","first_computed_at":"2026-07-05T11:57:45.994589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:57:45.994589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"voJy41iNiiSNaTdvNEaDid/CEnt6686+uH0JSwc16Wr8DvJ8Sh0f7ROyDyZwnAZm4OXdlRSJjEwuXYOApMiyCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:57:45.995075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.16319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2deeb2561137d63eddbad8ca96448578aa9d2e69083cd2d31042e820bc5ffa7c","sha256:dfc29b7276c7e371ef31fbb52c6fd67a56530e801e7812749660504fc4543aa0"],"state_sha256":"aa9ecf1524cd518ab75b93b9c8016e22fba422dec3154e0a9ac21a91302b6818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"niEtTkKA4CkSygmGCmnoWYBF4mJZ7c1Jnz4aJyzJrYeyJFSzog0nR9wQc060n8zjr3czfBXdrfkrn3ZsZ2u/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T20:18:16.107652Z","bundle_sha256":"5db789a0eb7348af7492d1747332fa4efc491c29549c2972362abd113e240722"}}