{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RP6WVUYPOK5SHLQ3HCA4WBOHKT","short_pith_number":"pith:RP6WVUYP","schema_version":"1.0","canonical_sha256":"8bfd6ad30f72bb23ae1b3881cb05c754eb34dbadbb2b963332c84f9416bf3ea5","source":{"kind":"arxiv","id":"1806.01799","version":2},"attestation_state":"computed","paper":{"title":"Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Maciej Besta, Torsten Hoefler","submitted_at":"2018-06-05T16:41:07Z","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"},"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":"1806.01799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:41:07Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"a85c9e8646d79c53a62c69007650862857453b5eadcaedf655ded5c8fe9f81cf","abstract_canon_sha256":"90d80faf5612dd0d38ac7f6d9fd58ade7c2db281d391287961de95b6b7cc4c54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.994637Z","signature_b64":"8bW1eLpwRySOxWdhlMGjLe/IQ5ShdtqSE1FbxOzl/kgN7Q6CA2ssPQO108iav5z4AmukHPSnZNGIFpH4oNlyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bfd6ad30f72bb23ae1b3881cb05c754eb34dbadbb2b963332c84f9416bf3ea5","last_reissued_at":"2026-05-17T23:47:39.994258Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.994258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Maciej Besta, Torsten Hoefler","submitted_at":"2018-06-05T16:41:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01799","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01799","created_at":"2026-05-17T23:47:39.994328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01799v2","created_at":"2026-05-17T23:47:39.994328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01799","created_at":"2026-05-17T23:47:39.994328+00:00"},{"alias_kind":"pith_short_12","alias_value":"RP6WVUYPOK5S","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RP6WVUYPOK5SHLQ3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RP6WVUYP","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02477","citing_title":"Speeding-up Graph Algorithms via Clique Partitioning","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.28096","citing_title":"Succinct Graph Representations and Algorithmic Applications","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT","json":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT.json","graph_json":"https://pith.science/api/pith-number/RP6WVUYPOK5SHLQ3HCA4WBOHKT/graph.json","events_json":"https://pith.science/api/pith-number/RP6WVUYPOK5SHLQ3HCA4WBOHKT/events.json","paper":"https://pith.science/paper/RP6WVUYP"},"agent_actions":{"view_html":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT","download_json":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT.json","view_paper":"https://pith.science/paper/RP6WVUYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01799&json=true","fetch_graph":"https://pith.science/api/pith-number/RP6WVUYPOK5SHLQ3HCA4WBOHKT/graph.json","fetch_events":"https://pith.science/api/pith-number/RP6WVUYPOK5SHLQ3HCA4WBOHKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT/action/storage_attestation","attest_author":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT/action/author_attestation","sign_citation":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT/action/citation_signature","submit_replication":"https://pith.science/pith/RP6WVUYPOK5SHLQ3HCA4WBOHKT/action/replication_record"}},"created_at":"2026-05-17T23:47:39.994328+00:00","updated_at":"2026-05-17T23:47:39.994328+00:00"}