{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WESM7FIPXEVSHUPBCZUJHRLKU6","short_pith_number":"pith:WESM7FIP","schema_version":"1.0","canonical_sha256":"b124cf950fb92b23d1e1166893c56aa7bb94f7a5ba626debeb845d0d3c3be7c3","source":{"kind":"arxiv","id":"2506.05156","version":1},"attestation_state":"computed","paper":{"title":"The Peculiarities of Extending Queue 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":"2025-06-05T15:34:41Z","abstract_excerpt":"We consider the problem of computing $\\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\\ell$ that avoid the nesting of edges on any of the pages. Inspired by previous work in the extension of stack layouts, here we consider the setting of extending a partial $\\ell$-page queue layout into a complete one and primarily analyze the problem through the refined lens of parameterized complexity. We obtain novel algorithms and lower bounds which provide a detailed picture of the problem's complexity under various meas"},"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":"2506.05156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-05T15:34:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de8d07360dd69f9cb08feb457b7d368ac8534ce22d26b6a41e5f59ac3c7988a5","abstract_canon_sha256":"bc5551326be58c14906c77c59a2f35f91ed8342ad28e445c5618107473dcb419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:43.260269Z","signature_b64":"ew6FnvkS03fTt+QtmPsqzyIdXMc5mlNK+JcB5YH8w1ZYryTMd5g0V7Qin79c1Nce2WO+R7s7BQDd9/US6FV+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b124cf950fb92b23d1e1166893c56aa7bb94f7a5ba626debeb845d0d3c3be7c3","last_reissued_at":"2026-07-05T11:16:43.259723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:43.259723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Peculiarities of Extending Queue 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":"2025-06-05T15:34:41Z","abstract_excerpt":"We consider the problem of computing $\\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\\ell$ that avoid the nesting of edges on any of the pages. Inspired by previous work in the extension of stack layouts, here we consider the setting of extending a partial $\\ell$-page queue layout into a complete one and primarily analyze the problem through the refined lens of parameterized complexity. We obtain novel algorithms and lower bounds which provide a detailed picture of the problem's complexity under various meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05156","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/2506.05156/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":"2506.05156","created_at":"2026-07-05T11:16:43.259782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05156v1","created_at":"2026-07-05T11:16:43.259782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05156","created_at":"2026-07-05T11:16:43.259782+00:00"},{"alias_kind":"pith_short_12","alias_value":"WESM7FIPXEVS","created_at":"2026-07-05T11:16:43.259782+00:00"},{"alias_kind":"pith_short_16","alias_value":"WESM7FIPXEVSHUPB","created_at":"2026-07-05T11:16:43.259782+00:00"},{"alias_kind":"pith_short_8","alias_value":"WESM7FIP","created_at":"2026-07-05T11:16:43.259782+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/WESM7FIPXEVSHUPBCZUJHRLKU6","json":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6.json","graph_json":"https://pith.science/api/pith-number/WESM7FIPXEVSHUPBCZUJHRLKU6/graph.json","events_json":"https://pith.science/api/pith-number/WESM7FIPXEVSHUPBCZUJHRLKU6/events.json","paper":"https://pith.science/paper/WESM7FIP"},"agent_actions":{"view_html":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6","download_json":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6.json","view_paper":"https://pith.science/paper/WESM7FIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05156&json=true","fetch_graph":"https://pith.science/api/pith-number/WESM7FIPXEVSHUPBCZUJHRLKU6/graph.json","fetch_events":"https://pith.science/api/pith-number/WESM7FIPXEVSHUPBCZUJHRLKU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/action/storage_attestation","attest_author":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/action/author_attestation","sign_citation":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/action/citation_signature","submit_replication":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/action/replication_record"}},"created_at":"2026-07-05T11:16:43.259782+00:00","updated_at":"2026-07-05T11:16:43.259782+00:00"}