{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VT45FJ4P5KUY3TLCUV6UH7BRTH","short_pith_number":"pith:VT45FJ4P","canonical_record":{"source":{"id":"1808.10841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"b55c71a08affb6cab48ca6751eabcfd87f0e1a49988b5dfc74f4d9aa99a31bc1","abstract_canon_sha256":"93f9f5b3d27536647e2a14f3b13d510572388fcc59fa5919960a9d9d2115ea65"},"schema_version":"1.0"},"canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","source":{"kind":"arxiv","id":"1808.10841","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10841","created_at":"2026-05-18T00:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10841v2","created_at":"2026-05-18T00:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10841","created_at":"2026-05-18T00:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"VT45FJ4P5KUY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VT45FJ4P5KUY3TLC","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VT45FJ4P","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VT45FJ4P5KUY3TLCUV6UH7BRTH","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"b55c71a08affb6cab48ca6751eabcfd87f0e1a49988b5dfc74f4d9aa99a31bc1","abstract_canon_sha256":"93f9f5b3d27536647e2a14f3b13d510572388fcc59fa5919960a9d9d2115ea65"},"schema_version":"1.0"},"canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:19.947045Z","signature_b64":"E2DWgIoM0Z7lNaYK9NnbGh5z/wVbtq3WorsdWbI03cYka9kO2+5ieMpqZPSpWfFKvC4Ak2JDZxnRsncd3YCECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","last_reissued_at":"2026-05-18T00:06:19.946439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:19.946439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10841","source_version":2,"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-05-18T00:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBsSC7ILK1DepQF10wF2Az3XKGOsik9vbChMoKWWpGyOtjULblVDTowdQWJTXCFm8xwzi5ypRRgWTJZ3kExXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:40:58.545364Z"},"content_sha256":"8f8e087058715f4d8c8c613b43eb248f182dd4cc23dfd4a88e31a44b76495f40","schema_version":"1.0","event_id":"sha256:8f8e087058715f4d8c8c613b43eb248f182dd4cc23dfd4a88e31a44b76495f40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VT45FJ4P5KUY3TLCUV6UH7BRTH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queue Layouts of Planar 3-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jawaherul Md. Alam, Martin Gronemann, Michael A. Bekos, Michael Kaufmann, Sergey Pupyrev","submitted_at":"2018-08-31T16:59:06Z","abstract_excerpt":"A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of G is the minimum number of queues required by any queue layout of G.\n  In this paper, we continue the study of the queue number of planar 3-trees. As opposed to general planar graphs, whose queue number is not known to be bounded by a constant, the queue number of planar 3-trees has been shown to be at most seven. In this work, we improve the upper bound to five. We also show that there exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10841","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UiWyn3T0EmsS8qmlWI3IrdWMbmn74zUICAx/sTTL1MJrkM8w6NjpTe3F5k/RiNavf/myDx4nDV8Sl/EnppwgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:40:58.545719Z"},"content_sha256":"81e3bd42a8cb670aea51a474173cb32b809dbbfdcd90dacc52f0d0ae5d64ac9f","schema_version":"1.0","event_id":"sha256:81e3bd42a8cb670aea51a474173cb32b809dbbfdcd90dacc52f0d0ae5d64ac9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/bundle.json","state_url":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/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-05-28T04:40:58Z","links":{"resolver":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH","bundle":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/bundle.json","state":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VT45FJ4P5KUY3TLCUV6UH7BRTH","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":"93f9f5b3d27536647e2a14f3b13d510572388fcc59fa5919960a9d9d2115ea65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:59:06Z","title_canon_sha256":"b55c71a08affb6cab48ca6751eabcfd87f0e1a49988b5dfc74f4d9aa99a31bc1"},"schema_version":"1.0","source":{"id":"1808.10841","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10841","created_at":"2026-05-18T00:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10841v2","created_at":"2026-05-18T00:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10841","created_at":"2026-05-18T00:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"VT45FJ4P5KUY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VT45FJ4P5KUY3TLC","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VT45FJ4P","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:81e3bd42a8cb670aea51a474173cb32b809dbbfdcd90dacc52f0d0ae5d64ac9f","target":"graph","created_at":"2026-05-18T00:06:19Z","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"},"paper":{"abstract_excerpt":"A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of G is the minimum number of queues required by any queue layout of G.\n  In this paper, we continue the study of the queue number of planar 3-trees. As opposed to general planar graphs, whose queue number is not known to be bounded by a constant, the queue number of planar 3-trees has been shown to be at most seven. In this work, we improve the upper bound to five. We also show that there exis","authors_text":"Jawaherul Md. Alam, Martin Gronemann, Michael A. Bekos, Michael Kaufmann, Sergey Pupyrev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:59:06Z","title":"Queue Layouts of Planar 3-Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10841","kind":"arxiv","version":2},"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:8f8e087058715f4d8c8c613b43eb248f182dd4cc23dfd4a88e31a44b76495f40","target":"record","created_at":"2026-05-18T00:06:19Z","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":"93f9f5b3d27536647e2a14f3b13d510572388fcc59fa5919960a9d9d2115ea65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:59:06Z","title_canon_sha256":"b55c71a08affb6cab48ca6751eabcfd87f0e1a49988b5dfc74f4d9aa99a31bc1"},"schema_version":"1.0","source":{"id":"1808.10841","kind":"arxiv","version":2}},"canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","first_computed_at":"2026-05-18T00:06:19.946439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:19.946439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E2DWgIoM0Z7lNaYK9NnbGh5z/wVbtq3WorsdWbI03cYka9kO2+5ieMpqZPSpWfFKvC4Ak2JDZxnRsncd3YCECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:19.947045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10841","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f8e087058715f4d8c8c613b43eb248f182dd4cc23dfd4a88e31a44b76495f40","sha256:81e3bd42a8cb670aea51a474173cb32b809dbbfdcd90dacc52f0d0ae5d64ac9f"],"state_sha256":"ddfbcb6f770c8319596b34d17f514c5862b986075468cd2fdd85be5e48ac4bc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQpEKEK4huQ536p+CyctuvJk1BI2kI+igLsfLZIXmeQDodgxYNEN1YhW2F31vjsJktwAgbzaKb3r9B20tmpIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:40:58.547656Z","bundle_sha256":"6470fd7f480f30bdf3fd88a89c0d8c1554e53990cca7cbec118a56bf0dce9b28"}}