{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UUTANO5HEUUC32XCCRDCCSBDKE","short_pith_number":"pith:UUTANO5H","canonical_record":{"source":{"id":"1904.04791","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-09T17:11:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"acfbeed2fa908d1739ecaa5ba7b8219f398db458e47190ec7c7155453d1545e9","abstract_canon_sha256":"c326573b5de9d8dc67fdeacf5f668204d968efaa96ca610d9fa92a06bf2b876a"},"schema_version":"1.0"},"canonical_sha256":"a52606bba725282deae2144621482351232fd127566d08f19c8d31876fb85b09","source":{"kind":"arxiv","id":"1904.04791","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04791","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04791v5","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04791","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"UUTANO5HEUUC","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"pith_short_16","alias_value":"UUTANO5HEUUC32XC","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"pith_short_8","alias_value":"UUTANO5H","created_at":"2026-07-05T01:25:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UUTANO5HEUUC32XCCRDCCSBDKE","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04791","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-09T17:11:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"acfbeed2fa908d1739ecaa5ba7b8219f398db458e47190ec7c7155453d1545e9","abstract_canon_sha256":"c326573b5de9d8dc67fdeacf5f668204d968efaa96ca610d9fa92a06bf2b876a"},"schema_version":"1.0"},"canonical_sha256":"a52606bba725282deae2144621482351232fd127566d08f19c8d31876fb85b09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:34.280537Z","signature_b64":"Pmz3oTtuw+dBrO2V0fGcpCA0Cjzs/zDnRur7meSWiH0MWYCpTt+NTEzSg/hFrC+he0ydhvDQKqcivI2Z0xthBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a52606bba725282deae2144621482351232fd127566d08f19c8d31876fb85b09","last_reissued_at":"2026-07-05T01:25:34.280052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:34.280052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04791","source_version":5,"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-05T01:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b12F/QNGlJmqKDYGxwX2yJhLjt9lQAp8svjBmWl8aPvuAPjAkXEWKDjgnXdlt6jBB3YzdBWfBALYdJSgmCcjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:30:41.924088Z"},"content_sha256":"4784568a22d6fa76a7a81a328630ff15e6702ea545dc1fb01c790338c34fc181","schema_version":"1.0","event_id":"sha256:4784568a22d6fa76a7a81a328630ff15e6702ea545dc1fb01c790338c34fc181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UUTANO5HEUUC32XCCRDCCSBDKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar graphs have bounded queue-number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David R. Wood, Gwena\\\"el Joret, Pat Morin, Piotr Micek, Torsten Ueckerdt, Vida Dujmovi\\'c","submitted_at":"2019-04-09T17:11:16Z","abstract_excerpt":"We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has a vertex-partition and a layering, such that each part has a bounded number of vertices in each layer, and the quotient graph has bounded treewidth. This result generalises for graphs of bounded Euler genus. Moreover, we prove that every graph in a minor-closed class has such a layered partition if and only if the class excludes some apex graph. Building on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04791","kind":"arxiv","version":5},"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/1904.04791/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-05T01:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fnrt81pnS4O+tPtoweD4DPkKCJD/OFhT9Drwga8VuUNUiuz90OWxf4YIp35vUY1LmqNgse2gE+bYxPwBHmw5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:30:41.925043Z"},"content_sha256":"adf8c43a65016fea2e2c24114270623e6c7a5e8d2e43c1e175cfadd6ddcc2c95","schema_version":"1.0","event_id":"sha256:adf8c43a65016fea2e2c24114270623e6c7a5e8d2e43c1e175cfadd6ddcc2c95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUTANO5HEUUC32XCCRDCCSBDKE/bundle.json","state_url":"https://pith.science/pith/UUTANO5HEUUC32XCCRDCCSBDKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUTANO5HEUUC32XCCRDCCSBDKE/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-16T11:30:41Z","links":{"resolver":"https://pith.science/pith/UUTANO5HEUUC32XCCRDCCSBDKE","bundle":"https://pith.science/pith/UUTANO5HEUUC32XCCRDCCSBDKE/bundle.json","state":"https://pith.science/pith/UUTANO5HEUUC32XCCRDCCSBDKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUTANO5HEUUC32XCCRDCCSBDKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UUTANO5HEUUC32XCCRDCCSBDKE","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":"c326573b5de9d8dc67fdeacf5f668204d968efaa96ca610d9fa92a06bf2b876a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-09T17:11:16Z","title_canon_sha256":"acfbeed2fa908d1739ecaa5ba7b8219f398db458e47190ec7c7155453d1545e9"},"schema_version":"1.0","source":{"id":"1904.04791","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04791","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04791v5","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04791","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"UUTANO5HEUUC","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"pith_short_16","alias_value":"UUTANO5HEUUC32XC","created_at":"2026-07-05T01:25:34Z"},{"alias_kind":"pith_short_8","alias_value":"UUTANO5H","created_at":"2026-07-05T01:25:34Z"}],"graph_snapshots":[{"event_id":"sha256:adf8c43a65016fea2e2c24114270623e6c7a5e8d2e43c1e175cfadd6ddcc2c95","target":"graph","created_at":"2026-07-05T01:25:34Z","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/1904.04791/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has a vertex-partition and a layering, such that each part has a bounded number of vertices in each layer, and the quotient graph has bounded treewidth. This result generalises for graphs of bounded Euler genus. Moreover, we prove that every graph in a minor-closed class has such a layered partition if and only if the class excludes some apex graph. Building on ","authors_text":"David R. Wood, Gwena\\\"el Joret, Pat Morin, Piotr Micek, Torsten Ueckerdt, Vida Dujmovi\\'c","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04791","kind":"arxiv","version":5},"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:4784568a22d6fa76a7a81a328630ff15e6702ea545dc1fb01c790338c34fc181","target":"record","created_at":"2026-07-05T01:25:34Z","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":"c326573b5de9d8dc67fdeacf5f668204d968efaa96ca610d9fa92a06bf2b876a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-09T17:11:16Z","title_canon_sha256":"acfbeed2fa908d1739ecaa5ba7b8219f398db458e47190ec7c7155453d1545e9"},"schema_version":"1.0","source":{"id":"1904.04791","kind":"arxiv","version":5}},"canonical_sha256":"a52606bba725282deae2144621482351232fd127566d08f19c8d31876fb85b09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a52606bba725282deae2144621482351232fd127566d08f19c8d31876fb85b09","first_computed_at":"2026-07-05T01:25:34.280052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:34.280052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pmz3oTtuw+dBrO2V0fGcpCA0Cjzs/zDnRur7meSWiH0MWYCpTt+NTEzSg/hFrC+he0ydhvDQKqcivI2Z0xthBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:34.280537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04791","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4784568a22d6fa76a7a81a328630ff15e6702ea545dc1fb01c790338c34fc181","sha256:adf8c43a65016fea2e2c24114270623e6c7a5e8d2e43c1e175cfadd6ddcc2c95"],"state_sha256":"399da10df4f9ccf13ad27a1c7180ade9ba2a9b6e087d5c77ffe2b4b27d608bc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qpis1Td1p18D1U4vOUhS/E+roq+0NyGgN6+o8s7H5mzbpClXgSj/dWZvqIhTjxzrX1jmoDPX2ajEHwvcGS55DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:30:41.932112Z","bundle_sha256":"1d4466be97801723480ab79b8c2f1c46d07f3883c00e73f28464f65eabea148b"}}