{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:D3U7ROHWAILO4JKQKXFWDL7H5X","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":"22774774c54801cfafad259e626001e74f4702a0ca4461542114c4a2f57d900d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T12:23:18Z","title_canon_sha256":"2a6ea1862464e17ee749d6080ad059ecad63c39bed7b629b28a476e60f87d964"},"schema_version":"1.0","source":{"id":"2305.09705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09705","created_at":"2026-07-05T06:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09705v1","created_at":"2026-07-05T06:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09705","created_at":"2026-07-05T06:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"D3U7ROHWAILO","created_at":"2026-07-05T06:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"D3U7ROHWAILO4JKQ","created_at":"2026-07-05T06:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"D3U7ROHW","created_at":"2026-07-05T06:10:53Z"}],"graph_snapshots":[{"event_id":"sha256:91f02d6d4a37cf93d9e19c875acdcf0c03e2dcc183ab9729fd72dbe2aeec4cf0","target":"graph","created_at":"2026-07-05T06:10:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.09705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alireza Makhzani, Ashish Khisti, Daniel Severo, James Townsend","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T12:23:18Z","title":"Random Edge Coding: One-Shot Bits-Back Coding of Large Labeled Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09705","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:77f593e8307615e632006fbdc8e872fd378d2f1ae0c705e2984d9fadebd9cb0d","target":"record","created_at":"2026-07-05T06:10:53Z","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":"22774774c54801cfafad259e626001e74f4702a0ca4461542114c4a2f57d900d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T12:23:18Z","title_canon_sha256":"2a6ea1862464e17ee749d6080ad059ecad63c39bed7b629b28a476e60f87d964"},"schema_version":"1.0","source":{"id":"2305.09705","kind":"arxiv","version":1}},"canonical_sha256":"1ee9f8b8f60216ee255055cb61afe7edea4e9fe65f5d032d29057cff95099b65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee9f8b8f60216ee255055cb61afe7edea4e9fe65f5d032d29057cff95099b65","first_computed_at":"2026-07-05T06:10:53.050049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:10:53.050049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8b5oubwsVygclN7MiNpZwXWfg8naiTDHX4CqVlG1Ao5Ti+Qjm4XAnasYjcMsVx9Hc9LUEvIKsUOr3HFmCJIZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:10:53.050495Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.09705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77f593e8307615e632006fbdc8e872fd378d2f1ae0c705e2984d9fadebd9cb0d","sha256:91f02d6d4a37cf93d9e19c875acdcf0c03e2dcc183ab9729fd72dbe2aeec4cf0"],"state_sha256":"cb974d102841445269dc0710fd19805185f73f10d0527e4d56835b9814860c07"}