{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PCODJ62YXNBBFHKWWWSOKZQJFU","short_pith_number":"pith:PCODJ62Y","canonical_record":{"source":{"id":"1608.06458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-23T10:48:18Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"ec966a56e84a3ce8f784201155cf0292c57eb86e97b23b9201aa4aa75c7796bf","abstract_canon_sha256":"15f7a428d61056c2a8b9bfe13be0090a5081f23e8d471d9723eb12d61981afeb"},"schema_version":"1.0"},"canonical_sha256":"789c34fb58bb42129d56b5a4e566092d01f7da64e442bb1cc5f27eee474f6f0b","source":{"kind":"arxiv","id":"1608.06458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06458","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06458v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06458","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"PCODJ62YXNBB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCODJ62YXNBBFHKW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCODJ62Y","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PCODJ62YXNBBFHKWWWSOKZQJFU","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-23T10:48:18Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"ec966a56e84a3ce8f784201155cf0292c57eb86e97b23b9201aa4aa75c7796bf","abstract_canon_sha256":"15f7a428d61056c2a8b9bfe13be0090a5081f23e8d471d9723eb12d61981afeb"},"schema_version":"1.0"},"canonical_sha256":"789c34fb58bb42129d56b5a4e566092d01f7da64e442bb1cc5f27eee474f6f0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:13.985285Z","signature_b64":"1gxIw46ZHD9RYd+AEpnopPhBY8bQHcfMDrMw8aW2UUpPu6HEM2hrRIpBmCLpuLkyAsapsB6eoQS9mbrXFIdWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"789c34fb58bb42129d56b5a4e566092d01f7da64e442bb1cc5f27eee474f6f0b","last_reissued_at":"2026-05-18T01:08:13.984851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:13.984851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06458","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-05-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UoSxgfIMvbaHgp4p1i78cmutR35nCIaBI5dRzkvXL4tnXRWTu+w2uIHkAUhT75fpWXQkc+NbXM/ljnCN0EgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:10:05.764189Z"},"content_sha256":"bc40cee687a27d3646983f7afed0a8d5fae057ae3d1398b1a5d95021e3025c5c","schema_version":"1.0","event_id":"sha256:bc40cee687a27d3646983f7afed0a8d5fae057ae3d1398b1a5d95021e3025c5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PCODJ62YXNBBFHKWWWSOKZQJFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stack and Queue Layouts via Layered Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Fabrizio Frati, Vida Dujmovi\\'c","submitted_at":"2016-08-23T10:48:18Z","abstract_excerpt":"It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors. For fixed $g$ and $k$, we show that every $n$-vertex graph that can be embedded on a surface of genus $g$ with at most $k$ crossings per edge has stack-number $\\mathcal{O}(\\log n)$; this includes $k$-planar graphs. The previously best known bound for the stack-number of these families was $\\mathcal{O}(\\sqrt{n})$, exce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06458","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":""},"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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFr9f053v6JAGr0t6RNu5CTJRq1VyYcvAikIPX/AZEWVSnp31t7KCYeerYjMiZ8OQOR+khJAQtoAuDVTjVU1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:10:05.764868Z"},"content_sha256":"1733cfbe0938e4a7bdeeb0285234bb11d36b285dc7e47a5a48dec0d1af4d72c5","schema_version":"1.0","event_id":"sha256:1733cfbe0938e4a7bdeeb0285234bb11d36b285dc7e47a5a48dec0d1af4d72c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCODJ62YXNBBFHKWWWSOKZQJFU/bundle.json","state_url":"https://pith.science/pith/PCODJ62YXNBBFHKWWWSOKZQJFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCODJ62YXNBBFHKWWWSOKZQJFU/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-19T07:10:05Z","links":{"resolver":"https://pith.science/pith/PCODJ62YXNBBFHKWWWSOKZQJFU","bundle":"https://pith.science/pith/PCODJ62YXNBBFHKWWWSOKZQJFU/bundle.json","state":"https://pith.science/pith/PCODJ62YXNBBFHKWWWSOKZQJFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCODJ62YXNBBFHKWWWSOKZQJFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCODJ62YXNBBFHKWWWSOKZQJFU","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":"15f7a428d61056c2a8b9bfe13be0090a5081f23e8d471d9723eb12d61981afeb","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-23T10:48:18Z","title_canon_sha256":"ec966a56e84a3ce8f784201155cf0292c57eb86e97b23b9201aa4aa75c7796bf"},"schema_version":"1.0","source":{"id":"1608.06458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06458","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06458v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06458","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"PCODJ62YXNBB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCODJ62YXNBBFHKW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCODJ62Y","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:1733cfbe0938e4a7bdeeb0285234bb11d36b285dc7e47a5a48dec0d1af4d72c5","target":"graph","created_at":"2026-05-18T01:08:13Z","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":"It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors. For fixed $g$ and $k$, we show that every $n$-vertex graph that can be embedded on a surface of genus $g$ with at most $k$ crossings per edge has stack-number $\\mathcal{O}(\\log n)$; this includes $k$-planar graphs. The previously best known bound for the stack-number of these families was $\\mathcal{O}(\\sqrt{n})$, exce","authors_text":"Fabrizio Frati, Vida Dujmovi\\'c","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-23T10:48:18Z","title":"Stack and Queue Layouts via Layered Separators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06458","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:bc40cee687a27d3646983f7afed0a8d5fae057ae3d1398b1a5d95021e3025c5c","target":"record","created_at":"2026-05-18T01:08:13Z","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":"15f7a428d61056c2a8b9bfe13be0090a5081f23e8d471d9723eb12d61981afeb","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-23T10:48:18Z","title_canon_sha256":"ec966a56e84a3ce8f784201155cf0292c57eb86e97b23b9201aa4aa75c7796bf"},"schema_version":"1.0","source":{"id":"1608.06458","kind":"arxiv","version":1}},"canonical_sha256":"789c34fb58bb42129d56b5a4e566092d01f7da64e442bb1cc5f27eee474f6f0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"789c34fb58bb42129d56b5a4e566092d01f7da64e442bb1cc5f27eee474f6f0b","first_computed_at":"2026-05-18T01:08:13.984851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.984851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1gxIw46ZHD9RYd+AEpnopPhBY8bQHcfMDrMw8aW2UUpPu6HEM2hrRIpBmCLpuLkyAsapsB6eoQS9mbrXFIdWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.985285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc40cee687a27d3646983f7afed0a8d5fae057ae3d1398b1a5d95021e3025c5c","sha256:1733cfbe0938e4a7bdeeb0285234bb11d36b285dc7e47a5a48dec0d1af4d72c5"],"state_sha256":"7d7427fdc49f120ea2cbf0bee4ce5178063403ad80f1209c64fa068cf712df35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCMNmrAH5Oo7qsctsQPEm4GTmT0YH+3z18tOYLVgfOzxadCfT4eLi4vOdfwZUcQMcg4oUnqWVVK/EFc4W1LYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:10:05.767602Z","bundle_sha256":"79ff3bbc0512b832344e2b54f4b232a3fd7f2da39c6a82153ae08a7b8c3e064e"}}