{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LR6S7FSZT36UPKQPPPKDNUHU5X","short_pith_number":"pith:LR6S7FSZ","schema_version":"1.0","canonical_sha256":"5c7d2f96599efd47aa0f7bd436d0f4edc9fedb2dfabe1b14d68cf047efe18871","source":{"kind":"arxiv","id":"1811.06749","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06749","created_at":"2026-05-18T00:00:33.990156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06749v1","created_at":"2026-05-18T00:00:33.990156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06749","created_at":"2026-05-18T00:00:33.990156+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR6S7FSZT36U","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR6S7FSZT36UPKQP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR6S7FSZ","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X","json":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X.json","graph_json":"https://pith.science/api/pith-number/LR6S7FSZT36UPKQPPPKDNUHU5X/graph.json","events_json":"https://pith.science/api/pith-number/LR6S7FSZT36UPKQPPPKDNUHU5X/events.json","paper":"https://pith.science/paper/LR6S7FSZ"},"agent_actions":{"view_html":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X","download_json":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X.json","view_paper":"https://pith.science/paper/LR6S7FSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06749&json=true","fetch_graph":"https://pith.science/api/pith-number/LR6S7FSZT36UPKQPPPKDNUHU5X/graph.json","fetch_events":"https://pith.science/api/pith-number/LR6S7FSZT36UPKQPPPKDNUHU5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/action/storage_attestation","attest_author":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/action/author_attestation","sign_citation":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/action/citation_signature","submit_replication":"https://pith.science/pith/LR6S7FSZT36UPKQPPPKDNUHU5X/action/replication_record"}},"created_at":"2026-05-18T00:00:33.990156+00:00","updated_at":"2026-05-18T00:00:33.990156+00:00"}