{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WXMJ7MJQFXNFBQJCQP72O3QBIE","short_pith_number":"pith:WXMJ7MJQ","canonical_record":{"source":{"id":"2608.05508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-08-06T01:22:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"22563e35c83ede3e27659bde01b379e5acd54e0807571a84d0d23a68ce8859ba","abstract_canon_sha256":"b9a67dfa473348f7cfeb5105830d0402848425e1e9651d10218ab950ced52490"},"schema_version":"1.0"},"canonical_sha256":"b5d89fb1302dda50c12283ffa76e0141233620358c8507e564451c382f5f4676","source":{"kind":"arxiv","id":"2608.05508","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05508","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05508v1","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05508","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"WXMJ7MJQFXNF","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"pith_short_16","alias_value":"WXMJ7MJQFXNFBQJC","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"pith_short_8","alias_value":"WXMJ7MJQ","created_at":"2026-08-07T00:47:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WXMJ7MJQFXNFBQJCQP72O3QBIE","target":"record","payload":{"canonical_record":{"source":{"id":"2608.05508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-08-06T01:22:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"22563e35c83ede3e27659bde01b379e5acd54e0807571a84d0d23a68ce8859ba","abstract_canon_sha256":"b9a67dfa473348f7cfeb5105830d0402848425e1e9651d10218ab950ced52490"},"schema_version":"1.0"},"canonical_sha256":"b5d89fb1302dda50c12283ffa76e0141233620358c8507e564451c382f5f4676","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:47:59.930334Z","signature_b64":"friy4YC4IllUcj78aIZHMHHf4obXG7GqUGh3Sda14McGEXoSF0eAzEpFRnqK2wYi4W0rWCYM2IGX621ikaNfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5d89fb1302dda50c12283ffa76e0141233620358c8507e564451c382f5f4676","last_reissued_at":"2026-08-07T00:47:59.928857Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:47:59.928857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.05508","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-08-07T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gDDpfxBh17i1ReAU3RvDR3MW37isjgmPFqpGpVr/fwd9vfr8LrHzl5EaLQrDE/Hpjlrqb3sjTypkzHltIMkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T22:14:51.882254Z"},"content_sha256":"11c7ec4176a03ade33f6d594679804ed779b8c90bf86883e1c17fefd2a65319e","schema_version":"1.0","event_id":"sha256:11c7ec4176a03ade33f6d594679804ed779b8c90bf86883e1c17fefd2a65319e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WXMJ7MJQFXNFBQJCQP72O3QBIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sergey Pupyrev","submitted_at":"2026-08-06T01:22:53Z","abstract_excerpt":"A queue layout of a graph consists of a linear order of the vertices and a partition of the edges into queues so that no two edges in a single queue are nested. The minimum number of queues needed in a queue layout of a graph is called its queue number. The planar product structure theorem states that every planar graph is a subgraph of the strong product of a graph of simple treewidth at most $3$, a clique $K_3$, and a path. Such a strong product admits a queue layout with $49$ queues (Wood, 2005), which implies that the queue number of planar graphs is at most $49$.\n  Recently, Bekos, Gronem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05508","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/2608.05508/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-08-07T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvIOCYO+nfYHr/VAOSGd3lti8I0X4l7IskAEHM5Q7HTK7qOPQe0HjFXZLMmbGE/w0RsnrT6udGQawVR/bo2BBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T22:14:51.883210Z"},"content_sha256":"e4d79b8acea956ffd10d56136ed3e24e285ed2b4b416ec3e16589e3b2804b1b6","schema_version":"1.0","event_id":"sha256:e4d79b8acea956ffd10d56136ed3e24e285ed2b4b416ec3e16589e3b2804b1b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE/bundle.json","state_url":"https://pith.science/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE/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-11T22:14:51Z","links":{"resolver":"https://pith.science/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE","bundle":"https://pith.science/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE/bundle.json","state":"https://pith.science/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXMJ7MJQFXNFBQJCQP72O3QBIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WXMJ7MJQFXNFBQJCQP72O3QBIE","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":"b9a67dfa473348f7cfeb5105830d0402848425e1e9651d10218ab950ced52490","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-08-06T01:22:53Z","title_canon_sha256":"22563e35c83ede3e27659bde01b379e5acd54e0807571a84d0d23a68ce8859ba"},"schema_version":"1.0","source":{"id":"2608.05508","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05508","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05508v1","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05508","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"WXMJ7MJQFXNF","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"pith_short_16","alias_value":"WXMJ7MJQFXNFBQJC","created_at":"2026-08-07T00:47:59Z"},{"alias_kind":"pith_short_8","alias_value":"WXMJ7MJQ","created_at":"2026-08-07T00:47:59Z"}],"graph_snapshots":[{"event_id":"sha256:e4d79b8acea956ffd10d56136ed3e24e285ed2b4b416ec3e16589e3b2804b1b6","target":"graph","created_at":"2026-08-07T00:47:59Z","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/2608.05508/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A queue layout of a graph consists of a linear order of the vertices and a partition of the edges into queues so that no two edges in a single queue are nested. The minimum number of queues needed in a queue layout of a graph is called its queue number. The planar product structure theorem states that every planar graph is a subgraph of the strong product of a graph of simple treewidth at most $3$, a clique $K_3$, and a path. Such a strong product admits a queue layout with $49$ queues (Wood, 2005), which implies that the queue number of planar graphs is at most $49$.\n  Recently, Bekos, Gronem","authors_text":"Sergey Pupyrev","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05508","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:11c7ec4176a03ade33f6d594679804ed779b8c90bf86883e1c17fefd2a65319e","target":"record","created_at":"2026-08-07T00:47:59Z","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":"b9a67dfa473348f7cfeb5105830d0402848425e1e9651d10218ab950ced52490","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-08-06T01:22:53Z","title_canon_sha256":"22563e35c83ede3e27659bde01b379e5acd54e0807571a84d0d23a68ce8859ba"},"schema_version":"1.0","source":{"id":"2608.05508","kind":"arxiv","version":1}},"canonical_sha256":"b5d89fb1302dda50c12283ffa76e0141233620358c8507e564451c382f5f4676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5d89fb1302dda50c12283ffa76e0141233620358c8507e564451c382f5f4676","first_computed_at":"2026-08-07T00:47:59.928857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T00:47:59.928857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"friy4YC4IllUcj78aIZHMHHf4obXG7GqUGh3Sda14McGEXoSF0eAzEpFRnqK2wYi4W0rWCYM2IGX621ikaNfBA==","signature_status":"signed_v1","signed_at":"2026-08-07T00:47:59.930334Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.05508","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11c7ec4176a03ade33f6d594679804ed779b8c90bf86883e1c17fefd2a65319e","sha256:e4d79b8acea956ffd10d56136ed3e24e285ed2b4b416ec3e16589e3b2804b1b6"],"state_sha256":"fc774345f0a519583f98674cace8a8272706c18c72dd1672d3925192024e4284"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fj9iqEEvdP/W18Z0VAuf1hVBfOJxVfppx4Cdjr1qhqIYvYLFbfjEdkdCz+/+AWLVMJOg7y7EF+yiv/EF5Xh6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T22:14:51.902738Z","bundle_sha256":"ed0e367323b60baa989f572e5100baafcc2470dffcc3126a31ebd7dfee76a81a"}}