{"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"}