{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LR6S7FSZT36UPKQPPPKDNUHU5X","short_pith_number":"pith:LR6S7FSZ","canonical_record":{"source":{"id":"1811.06749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T11:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"7ccdf5bdf40c93a6f95405a7e01d2cb09ac9546fc34115ed3d82b1c713fa1dc6","abstract_canon_sha256":"98f1a6cc60598a89924a0fe4ddb3488e2f47b71601c0594320d16eaab6f19f26"},"schema_version":"1.0"},"canonical_sha256":"5c7d2f96599efd47aa0f7bd436d0f4edc9fedb2dfabe1b14d68cf047efe18871","source":{"kind":"arxiv","id":"1811.06749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06749","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06749v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06749","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"LR6S7FSZT36U","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LR6S7FSZT36UPKQP","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LR6S7FSZ","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LR6S7FSZT36UPKQPPPKDNUHU5X","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T11:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"7ccdf5bdf40c93a6f95405a7e01d2cb09ac9546fc34115ed3d82b1c713fa1dc6","abstract_canon_sha256":"98f1a6cc60598a89924a0fe4ddb3488e2f47b71601c0594320d16eaab6f19f26"},"schema_version":"1.0"},"canonical_sha256":"5c7d2f96599efd47aa0f7bd436d0f4edc9fedb2dfabe1b14d68cf047efe18871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.990547Z","signature_b64":"OXT0VIlsgjftEgUJbmQUOryUEbwejfpV7Z/N183vUoQ++WsIJjxfeJUcWKLfJ0iTdD7t4mQs589wu3pxOMLeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c7d2f96599efd47aa0f7bd436d0f4edc9fedb2dfabe1b14d68cf047efe18871","last_reissued_at":"2026-05-18T00:00:33.990085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.990085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06749","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-18T00:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJuNGYGOXpZZ43PQDgRKaWeZsasFyESWvPLdOwKAEme3JtOhJvRfiZy6lM9OmER3zroePx/rmXcJaFfI+7InCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:53.820448Z"},"content_sha256":"fde6eb15049357a64d70e9b651accd626a9e838e5cd466554cf7b85520a0d673","schema_version":"1.0","event_id":"sha256:fde6eb15049357a64d70e9b651accd626a9e838e5cd466554cf7b85520a0d673"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LR6S7FSZT36UPKQPPPKDNUHU5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub T\\v{e}tek, Tom\\'a\\v{s} Gaven\\v{c}iak","submitted_at":"2018-11-16T11:01:06Z","abstract_excerpt":"Compact and I/O-efficient data representations play an important role in efficient algorithm design, as memory bandwidth and latency can present a significant performance bottleneck, slowing the computation by orders of magnitude. While this problem is very well explored in e.g. uniform numerical data processing, structural data applications (e.g. on huge graphs) require different algorithm-dependent approaches. Separable graph classes (i.e. graph classes with balanced separators of size $\\mathcal{O}(n^c)$ with $c < 1$) include planar graphs, bounded genus graphs, and minor-free graphs.\n  In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06749","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-18T00:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2W4QFVoc1oXSp1SWr7VLu/JNcoWuKIx/nN72ELzXXIMJdf3KqgMaF2g7M15yqDvohW/dxyo0B/J62Z5HBxfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:53.820806Z"},"content_sha256":"78ac4a84f80d16c16d49537f26e6a44091f96b833b22229bd9e55f49cbfe8ffb","schema_version":"1.0","event_id":"sha256:78ac4a84f80d16c16d49537f26e6a44091f96b833b22229bd9e55f49cbfe8ffb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/bundle.json","state_url":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/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-06-05T12:47:53Z","links":{"resolver":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X","bundle":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/bundle.json","state":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LR6S7FSZT36UPKQPPPKDNUHU5X","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":"98f1a6cc60598a89924a0fe4ddb3488e2f47b71601c0594320d16eaab6f19f26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T11:01:06Z","title_canon_sha256":"7ccdf5bdf40c93a6f95405a7e01d2cb09ac9546fc34115ed3d82b1c713fa1dc6"},"schema_version":"1.0","source":{"id":"1811.06749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06749","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06749v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06749","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"LR6S7FSZT36U","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LR6S7FSZT36UPKQP","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LR6S7FSZ","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:78ac4a84f80d16c16d49537f26e6a44091f96b833b22229bd9e55f49cbfe8ffb","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"Compact and I/O-efficient data representations play an important role in efficient algorithm design, as memory bandwidth and latency can present a significant performance bottleneck, slowing the computation by orders of magnitude. While this problem is very well explored in e.g. uniform numerical data processing, structural data applications (e.g. on huge graphs) require different algorithm-dependent approaches. Separable graph classes (i.e. graph classes with balanced separators of size $\\mathcal{O}(n^c)$ with $c < 1$) include planar graphs, bounded genus graphs, and minor-free graphs.\n  In t","authors_text":"Jakub T\\v{e}tek, Tom\\'a\\v{s} Gaven\\v{c}iak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T11:01:06Z","title":"Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06749","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:fde6eb15049357a64d70e9b651accd626a9e838e5cd466554cf7b85520a0d673","target":"record","created_at":"2026-05-18T00:00:33Z","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":"98f1a6cc60598a89924a0fe4ddb3488e2f47b71601c0594320d16eaab6f19f26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T11:01:06Z","title_canon_sha256":"7ccdf5bdf40c93a6f95405a7e01d2cb09ac9546fc34115ed3d82b1c713fa1dc6"},"schema_version":"1.0","source":{"id":"1811.06749","kind":"arxiv","version":1}},"canonical_sha256":"5c7d2f96599efd47aa0f7bd436d0f4edc9fedb2dfabe1b14d68cf047efe18871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c7d2f96599efd47aa0f7bd436d0f4edc9fedb2dfabe1b14d68cf047efe18871","first_computed_at":"2026-05-18T00:00:33.990085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.990085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OXT0VIlsgjftEgUJbmQUOryUEbwejfpV7Z/N183vUoQ++WsIJjxfeJUcWKLfJ0iTdD7t4mQs589wu3pxOMLeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.990547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fde6eb15049357a64d70e9b651accd626a9e838e5cd466554cf7b85520a0d673","sha256:78ac4a84f80d16c16d49537f26e6a44091f96b833b22229bd9e55f49cbfe8ffb"],"state_sha256":"68ab049e141f913f6289cce593d004691719eaebe08125179c826f9bcb02bb0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxyLt9YneLJWYlOsthCNqU63SPf2ChEjJ0IPo6PJA3RXUC005UkrRnkazcgggfA8x0TVNtSJvPB6eGgh3VFJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:47:53.822743Z","bundle_sha256":"8f35ff0ac861c7faa7ee749b42ad0e7448fb9e1cf6057b8a46e3dd01114d8144"}}