{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YLIC4YJQUU4OPVNCALJKKSF27S","short_pith_number":"pith:YLIC4YJQ","schema_version":"1.0","canonical_sha256":"c2d02e6130a538e7d5a202d2a548bafca74cb78417cafcdbe046bdfd17974beb","source":{"kind":"arxiv","id":"2409.02833","version":1},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of Extending Stack Layouts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin N\\\"ollenburg, Robert Ganian, Simon D. Fink, Thomas Depian","submitted_at":"2024-09-04T15:58:54Z","abstract_excerpt":"An $\\ell$-page stack layout (also known as an $\\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\\ell$ stacks (or pages), such that the endpoints of no two edges on the same stack alternate. We study the problem of extending a given partial $\\ell$-page stack layout into a complete one, which can be seen as a natural generalization of the classical NP-hard problem of computing a stack layout of an input graph from scratch. Given the inherent intractability of the problem, we focus on identifying tractable fragments through "},"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":"2409.02833","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-04T15:58:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"75b1da69dc199dbc5752a7d0a291e846296a2501bd596ba9a5efd94759093176","abstract_canon_sha256":"3d90f8665648bde262a7798ebbfea08bd2ab77e3bbc3600af21ded2407c79d29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:10.907981Z","signature_b64":"JAkR5/Xz21QkB4qbjv4IRZ0ByCttHOX4IB1z/XcDS99RlIcmSGICpNpcNNoCWN130Hx0Zjop//a/oxdzO5LMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d02e6130a538e7d5a202d2a548bafca74cb78417cafcdbe046bdfd17974beb","last_reissued_at":"2026-07-05T09:03:10.907100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:10.907100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Extending Stack Layouts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin N\\\"ollenburg, Robert Ganian, Simon D. Fink, Thomas Depian","submitted_at":"2024-09-04T15:58:54Z","abstract_excerpt":"An $\\ell$-page stack layout (also known as an $\\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\\ell$ stacks (or pages), such that the endpoints of no two edges on the same stack alternate. We study the problem of extending a given partial $\\ell$-page stack layout into a complete one, which can be seen as a natural generalization of the classical NP-hard problem of computing a stack layout of an input graph from scratch. Given the inherent intractability of the problem, we focus on identifying tractable fragments through "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02833","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/2409.02833/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":"2409.02833","created_at":"2026-07-05T09:03:10.907238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02833v1","created_at":"2026-07-05T09:03:10.907238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02833","created_at":"2026-07-05T09:03:10.907238+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLIC4YJQUU4O","created_at":"2026-07-05T09:03:10.907238+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLIC4YJQUU4OPVNC","created_at":"2026-07-05T09:03:10.907238+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLIC4YJQ","created_at":"2026-07-05T09:03:10.907238+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/YLIC4YJQUU4OPVNCALJKKSF27S","json":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S.json","graph_json":"https://pith.science/api/pith-number/YLIC4YJQUU4OPVNCALJKKSF27S/graph.json","events_json":"https://pith.science/api/pith-number/YLIC4YJQUU4OPVNCALJKKSF27S/events.json","paper":"https://pith.science/paper/YLIC4YJQ"},"agent_actions":{"view_html":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S","download_json":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S.json","view_paper":"https://pith.science/paper/YLIC4YJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02833&json=true","fetch_graph":"https://pith.science/api/pith-number/YLIC4YJQUU4OPVNCALJKKSF27S/graph.json","fetch_events":"https://pith.science/api/pith-number/YLIC4YJQUU4OPVNCALJKKSF27S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S/action/storage_attestation","attest_author":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S/action/author_attestation","sign_citation":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S/action/citation_signature","submit_replication":"https://pith.science/pith/YLIC4YJQUU4OPVNCALJKKSF27S/action/replication_record"}},"created_at":"2026-07-05T09:03:10.907238+00:00","updated_at":"2026-07-05T09:03:10.907238+00:00"}