{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HOFLWUU5YLEJWB2DNXHJ3EQMHZ","short_pith_number":"pith:HOFLWUU5","canonical_record":{"source":{"id":"1301.0957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T00:54:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71c9caa8f968b760c77e62c86f0a561f131e63aa2652d4552217641ba9b33c55","abstract_canon_sha256":"0126975a232061c93acfa8483bdafaff5b1dc677c4ad3c3f8c26f5597f5e9ffe"},"schema_version":"1.0"},"canonical_sha256":"3b8abb529dc2c89b07436dce9d920c3e5010de66aa04630228e226a7b003e37d","source":{"kind":"arxiv","id":"1301.0957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0957","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0957v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0957","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"HOFLWUU5YLEJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOFLWUU5YLEJWB2D","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOFLWUU5","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HOFLWUU5YLEJWB2DNXHJ3EQMHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T00:54:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71c9caa8f968b760c77e62c86f0a561f131e63aa2652d4552217641ba9b33c55","abstract_canon_sha256":"0126975a232061c93acfa8483bdafaff5b1dc677c4ad3c3f8c26f5597f5e9ffe"},"schema_version":"1.0"},"canonical_sha256":"3b8abb529dc2c89b07436dce9d920c3e5010de66aa04630228e226a7b003e37d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.205634Z","signature_b64":"HZLgizjvGs9c/bWlImxZ89OH0TwZB29th1ikz21nM26hHrQ7+qOA3vBxO9Jb5wITnRgk/20ZT6dXnfvgftqfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8abb529dc2c89b07436dce9d920c3e5010de66aa04630228e226a7b003e37d","last_reissued_at":"2026-05-18T03:37:07.204908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.204908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0957","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ntHLP53kQUbztprG5VJH9StXEPFhIpK2NeiztbpOtvZCHgIrvhpv5V2C4mzs0UkwsJ40om5Z35qAEjqOrwTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:34:58.539544Z"},"content_sha256":"efcfacb1f5eecca7623e3dd4ca1b15a62bb1d024ad72c58990c1f6139b5b759c","schema_version":"1.0","event_id":"sha256:efcfacb1f5eecca7623e3dd4ca1b15a62bb1d024ad72c58990c1f6139b5b759c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HOFLWUU5YLEJWB2DNXHJ3EQMHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Large Scale Distributed Compression and Dispersive Information Routing for Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankur Saxena, Emrah Akyol, Kenneth Rose, Kumar Viswanatha, Sharadh Ramaswamy","submitted_at":"2013-01-06T00:54:09Z","abstract_excerpt":"This paper considers the problem of distributed source coding for a large network. A major obstacle that poses an existential threat to practical deployment of conventional approaches to distributed coding is the exponential growth of the decoder complexity with the number of sources and the encoding rates. This growth in complexity renders many traditional approaches impractical even for moderately sized networks. In this paper, we propose a new decoding paradigm for large scale distributed compression wherein the decoder complexity is explicitly controlled during the design. Central to our a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0957","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ItYEb04v2ragzhOIjNWTSoLoJc8xnYY4TSZNXYxfqXRAYilmKaZPdXWvN1E8ToCseiJvBpsmHYDWuPxobAgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:34:58.540229Z"},"content_sha256":"79b9c5fb29027b1021a3fe4ed55b5d75bbd1aa32e34783618b312eaae64df003","schema_version":"1.0","event_id":"sha256:79b9c5fb29027b1021a3fe4ed55b5d75bbd1aa32e34783618b312eaae64df003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ/bundle.json","state_url":"https://pith.science/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T06:34:58Z","links":{"resolver":"https://pith.science/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ","bundle":"https://pith.science/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ/bundle.json","state":"https://pith.science/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOFLWUU5YLEJWB2DNXHJ3EQMHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HOFLWUU5YLEJWB2DNXHJ3EQMHZ","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":"0126975a232061c93acfa8483bdafaff5b1dc677c4ad3c3f8c26f5597f5e9ffe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T00:54:09Z","title_canon_sha256":"71c9caa8f968b760c77e62c86f0a561f131e63aa2652d4552217641ba9b33c55"},"schema_version":"1.0","source":{"id":"1301.0957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0957","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0957v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0957","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"HOFLWUU5YLEJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOFLWUU5YLEJWB2D","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOFLWUU5","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:79b9c5fb29027b1021a3fe4ed55b5d75bbd1aa32e34783618b312eaae64df003","target":"graph","created_at":"2026-05-18T03:37:07Z","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":"This paper considers the problem of distributed source coding for a large network. A major obstacle that poses an existential threat to practical deployment of conventional approaches to distributed coding is the exponential growth of the decoder complexity with the number of sources and the encoding rates. This growth in complexity renders many traditional approaches impractical even for moderately sized networks. In this paper, we propose a new decoding paradigm for large scale distributed compression wherein the decoder complexity is explicitly controlled during the design. Central to our a","authors_text":"Ankur Saxena, Emrah Akyol, Kenneth Rose, Kumar Viswanatha, Sharadh Ramaswamy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T00:54:09Z","title":"On Large Scale Distributed Compression and Dispersive Information Routing for Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0957","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:efcfacb1f5eecca7623e3dd4ca1b15a62bb1d024ad72c58990c1f6139b5b759c","target":"record","created_at":"2026-05-18T03:37:07Z","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":"0126975a232061c93acfa8483bdafaff5b1dc677c4ad3c3f8c26f5597f5e9ffe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T00:54:09Z","title_canon_sha256":"71c9caa8f968b760c77e62c86f0a561f131e63aa2652d4552217641ba9b33c55"},"schema_version":"1.0","source":{"id":"1301.0957","kind":"arxiv","version":1}},"canonical_sha256":"3b8abb529dc2c89b07436dce9d920c3e5010de66aa04630228e226a7b003e37d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b8abb529dc2c89b07436dce9d920c3e5010de66aa04630228e226a7b003e37d","first_computed_at":"2026-05-18T03:37:07.204908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:07.204908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZLgizjvGs9c/bWlImxZ89OH0TwZB29th1ikz21nM26hHrQ7+qOA3vBxO9Jb5wITnRgk/20ZT6dXnfvgftqfAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:07.205634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efcfacb1f5eecca7623e3dd4ca1b15a62bb1d024ad72c58990c1f6139b5b759c","sha256:79b9c5fb29027b1021a3fe4ed55b5d75bbd1aa32e34783618b312eaae64df003"],"state_sha256":"5835f709d8bd2fc4cf04ed21240c94944818d635c5c9cdf16939fc44a7bba73f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSXFipEGzVP9SRytQRg2g+4xqqKrfHT/3XDpCbsY6GA8nfFG892nY+o5QWfyDXc2A6g3YfXTIVxfaz7FTy2pDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:34:58.544127Z","bundle_sha256":"83d270248404979e6ca4d0ac1aa37c1f68bddaf829772df1c01a759ad8bfcd99"}}