{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WESM7FIPXEVSHUPBCZUJHRLKU6","short_pith_number":"pith:WESM7FIP","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"},"canonical_sha256":"b124cf950fb92b23d1e1166893c56aa7bb94f7a5ba626debeb845d0d3c3be7c3","source":{"kind":"arxiv","id":"2506.05156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05156","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05156v1","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05156","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"pith_short_12","alias_value":"WESM7FIPXEVS","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"pith_short_16","alias_value":"WESM7FIPXEVSHUPB","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"pith_short_8","alias_value":"WESM7FIP","created_at":"2026-07-05T11:16:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WESM7FIPXEVSHUPBCZUJHRLKU6","target":"record","payload":{"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"},"canonical_sha256":"b124cf950fb92b23d1e1166893c56aa7bb94f7a5ba626debeb845d0d3c3be7c3","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"},"source_kind":"arxiv","source_id":"2506.05156","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:16:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQTG3SQh5zgAcDiTyKg1kzYqeMH70ulre8Gm8qdCt5mg3BtfW9T3A5wphyoXkcrMUiOnLzzD9jvakE6IfU08CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:36:54.227887Z"},"content_sha256":"633ee0f52faccfb4e0efd8533421b55526fd8d4114967fc822ad7ce17e4dbad4","schema_version":"1.0","event_id":"sha256:633ee0f52faccfb4e0efd8533421b55526fd8d4114967fc822ad7ce17e4dbad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WESM7FIPXEVSHUPBCZUJHRLKU6","target":"graph","payload":{"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"},"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:16:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVUY3jmDj+8XzHNxDSoSbYKFIgrXpIuUgsXmMu0ThmDTGHrXnKWFI4kyVrT5wJ5KIYGU+Mp0SNFi2zB1xYzIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:36:54.228391Z"},"content_sha256":"6b061af00cea064b25e58340dcd7d7741bf254d85009e62a4fc68beef64183c1","schema_version":"1.0","event_id":"sha256:6b061af00cea064b25e58340dcd7d7741bf254d85009e62a4fc68beef64183c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/bundle.json","state_url":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/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-08T00:36:54Z","links":{"resolver":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6","bundle":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/bundle.json","state":"https://pith.science/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WESM7FIPXEVSHUPBCZUJHRLKU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WESM7FIPXEVSHUPBCZUJHRLKU6","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":"bc5551326be58c14906c77c59a2f35f91ed8342ad28e445c5618107473dcb419","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-05T15:34:41Z","title_canon_sha256":"de8d07360dd69f9cb08feb457b7d368ac8534ce22d26b6a41e5f59ac3c7988a5"},"schema_version":"1.0","source":{"id":"2506.05156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05156","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05156v1","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05156","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"pith_short_12","alias_value":"WESM7FIPXEVS","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"pith_short_16","alias_value":"WESM7FIPXEVSHUPB","created_at":"2026-07-05T11:16:43Z"},{"alias_kind":"pith_short_8","alias_value":"WESM7FIP","created_at":"2026-07-05T11:16:43Z"}],"graph_snapshots":[{"event_id":"sha256:6b061af00cea064b25e58340dcd7d7741bf254d85009e62a4fc68beef64183c1","target":"graph","created_at":"2026-07-05T11:16:43Z","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/2506.05156/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Martin N\\\"ollenburg, Robert Ganian, Simon D. Fink, Thomas Depian","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-05T15:34:41Z","title":"The Peculiarities of Extending Queue Layouts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05156","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:633ee0f52faccfb4e0efd8533421b55526fd8d4114967fc822ad7ce17e4dbad4","target":"record","created_at":"2026-07-05T11:16:43Z","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":"bc5551326be58c14906c77c59a2f35f91ed8342ad28e445c5618107473dcb419","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-05T15:34:41Z","title_canon_sha256":"de8d07360dd69f9cb08feb457b7d368ac8534ce22d26b6a41e5f59ac3c7988a5"},"schema_version":"1.0","source":{"id":"2506.05156","kind":"arxiv","version":1}},"canonical_sha256":"b124cf950fb92b23d1e1166893c56aa7bb94f7a5ba626debeb845d0d3c3be7c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b124cf950fb92b23d1e1166893c56aa7bb94f7a5ba626debeb845d0d3c3be7c3","first_computed_at":"2026-07-05T11:16:43.259723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:43.259723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ew6FnvkS03fTt+QtmPsqzyIdXMc5mlNK+JcB5YH8w1ZYryTMd5g0V7Qin79c1Nce2WO+R7s7BQDd9/US6FV+AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:43.260269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:633ee0f52faccfb4e0efd8533421b55526fd8d4114967fc822ad7ce17e4dbad4","sha256:6b061af00cea064b25e58340dcd7d7741bf254d85009e62a4fc68beef64183c1"],"state_sha256":"7a1b9a4eb9e48fa82842f261a93291518d707e9992a3cace35d963cbaa4a6e46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rh67x147lW2ssjVgtIYtYB+q0XMoiPEUp9w3T46liQbotKT4Xfe11Uyzhvv23ATcBsh9be7gkLjDQaqYm1xRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:36:54.231629Z","bundle_sha256":"34f8cc2b52a38b9dd4ec9ab90c2bc5c0b0f2699c5dec7abcd71a69797f7818d9"}}