{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RP6WVUYPOK5SHLQ3HCA4WBOHKT","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":"90d80faf5612dd0d38ac7f6d9fd58ade7c2db281d391287961de95b6b7cc4c54","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:41:07Z","title_canon_sha256":"a85c9e8646d79c53a62c69007650862857453b5eadcaedf655ded5c8fe9f81cf"},"schema_version":"1.0","source":{"id":"1806.01799","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01799","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01799v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01799","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"RP6WVUYPOK5S","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RP6WVUYPOK5SHLQ3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RP6WVUYP","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:1a3325cea4e38442c8a132d058741c64b3252d20a59d0edf1f5202892ef69e8e","target":"graph","created_at":"2026-05-17T23:47:39Z","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":"Various graphs such as web or social networks may contain up to trillions of edges. Compressing such datasets can accelerate graph processing by reducing the amount of I/O accesses and the pressure on the memory subsystem. Yet, selecting a proper compression method is challenging as there exist a plethora of techniques, algorithms, domains, and approaches in compressing graphs. To facilitate this, we present a survey and taxonomy on lossless graph compression that is the first, to the best of our knowledge, to exhaustively analyze this domain. Moreover, our survey does not only categorize exis","authors_text":"Maciej Besta, Torsten Hoefler","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:41:07Z","title":"Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01799","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:d02484f46256994298fb64455dbd3b90ef714b1c31d816e9fa4a101a945aad0f","target":"record","created_at":"2026-05-17T23:47:39Z","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":"90d80faf5612dd0d38ac7f6d9fd58ade7c2db281d391287961de95b6b7cc4c54","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:41:07Z","title_canon_sha256":"a85c9e8646d79c53a62c69007650862857453b5eadcaedf655ded5c8fe9f81cf"},"schema_version":"1.0","source":{"id":"1806.01799","kind":"arxiv","version":2}},"canonical_sha256":"8bfd6ad30f72bb23ae1b3881cb05c754eb34dbadbb2b963332c84f9416bf3ea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bfd6ad30f72bb23ae1b3881cb05c754eb34dbadbb2b963332c84f9416bf3ea5","first_computed_at":"2026-05-17T23:47:39.994258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.994258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8bW1eLpwRySOxWdhlMGjLe/IQ5ShdtqSE1FbxOzl/kgN7Q6CA2ssPQO108iav5z4AmukHPSnZNGIFpH4oNlyAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.994637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01799","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d02484f46256994298fb64455dbd3b90ef714b1c31d816e9fa4a101a945aad0f","sha256:1a3325cea4e38442c8a132d058741c64b3252d20a59d0edf1f5202892ef69e8e"],"state_sha256":"3ed980382959e365d14a787188ace0225f982c0a6dc6acbcc33d4e67a83d3c33"}