{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:D3U7ROHWAILO4JKQKXFWDL7H5X","short_pith_number":"pith:D3U7ROHW","schema_version":"1.0","canonical_sha256":"1ee9f8b8f60216ee255055cb61afe7edea4e9fe65f5d032d29057cff95099b65","source":{"kind":"arxiv","id":"2305.09705","version":1},"attestation_state":"computed","paper":{"title":"Random Edge Coding: One-Shot Bits-Back Coding of Large Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Alireza Makhzani, Ashish Khisti, Daniel Severo, James Townsend","submitted_at":"2023-05-16T12:23:18Z","abstract_excerpt":"We present a one-shot method for compressing large labeled graphs called Random Edge Coding. When paired with a parameter-free model based on P\\'olya's Urn, the worst-case computational and memory complexities scale quasi-linearly and linearly with the number of observed edges, making it efficient on sparse graphs, and requires only integer arithmetic. Key to our method is bits-back coding, which is used to sample edges and vertices without replacement from the edge-list in a way that preserves the structure of the graph. Optimality is proven under a class of random graph models that are invar"},"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":"2305.09705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T12:23:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2a6ea1862464e17ee749d6080ad059ecad63c39bed7b629b28a476e60f87d964","abstract_canon_sha256":"22774774c54801cfafad259e626001e74f4702a0ca4461542114c4a2f57d900d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:53.050495Z","signature_b64":"8b5oubwsVygclN7MiNpZwXWfg8naiTDHX4CqVlG1Ao5Ti+Qjm4XAnasYjcMsVx9Hc9LUEvIKsUOr3HFmCJIZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee9f8b8f60216ee255055cb61afe7edea4e9fe65f5d032d29057cff95099b65","last_reissued_at":"2026-07-05T06:10:53.050049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:53.050049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Edge Coding: One-Shot Bits-Back Coding of Large Labeled Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Alireza Makhzani, Ashish Khisti, Daniel Severo, James Townsend","submitted_at":"2023-05-16T12:23:18Z","abstract_excerpt":"We present a one-shot method for compressing large labeled graphs called Random Edge Coding. When paired with a parameter-free model based on P\\'olya's Urn, the worst-case computational and memory complexities scale quasi-linearly and linearly with the number of observed edges, making it efficient on sparse graphs, and requires only integer arithmetic. Key to our method is bits-back coding, which is used to sample edges and vertices without replacement from the edge-list in a way that preserves the structure of the graph. Optimality is proven under a class of random graph models that are invar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09705","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.09705/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.09705","created_at":"2026-07-05T06:10:53.050103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.09705v1","created_at":"2026-07-05T06:10:53.050103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09705","created_at":"2026-07-05T06:10:53.050103+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3U7ROHWAILO","created_at":"2026-07-05T06:10:53.050103+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3U7ROHWAILO4JKQ","created_at":"2026-07-05T06:10:53.050103+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3U7ROHW","created_at":"2026-07-05T06:10:53.050103+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.10479","citing_title":"Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X","json":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X.json","graph_json":"https://pith.science/api/pith-number/D3U7ROHWAILO4JKQKXFWDL7H5X/graph.json","events_json":"https://pith.science/api/pith-number/D3U7ROHWAILO4JKQKXFWDL7H5X/events.json","paper":"https://pith.science/paper/D3U7ROHW"},"agent_actions":{"view_html":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X","download_json":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X.json","view_paper":"https://pith.science/paper/D3U7ROHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.09705&json=true","fetch_graph":"https://pith.science/api/pith-number/D3U7ROHWAILO4JKQKXFWDL7H5X/graph.json","fetch_events":"https://pith.science/api/pith-number/D3U7ROHWAILO4JKQKXFWDL7H5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X/action/storage_attestation","attest_author":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X/action/author_attestation","sign_citation":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X/action/citation_signature","submit_replication":"https://pith.science/pith/D3U7ROHWAILO4JKQKXFWDL7H5X/action/replication_record"}},"created_at":"2026-07-05T06:10:53.050103+00:00","updated_at":"2026-07-05T06:10:53.050103+00:00"}