{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NJ6X4P3HXIDMHZO2H7JKC5LI35","short_pith_number":"pith:NJ6X4P3H","canonical_record":{"source":{"id":"1209.4383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-19T22:31:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12ae3605cf99c1473e67394142556fdf5bc9ed90a6616b28ce7d0724f9b29021","abstract_canon_sha256":"a7cdaa4db830e9a5e23f944e860a4e2e63cbf8fc41181c5cb2c71a4dd2a4149a"},"schema_version":"1.0"},"canonical_sha256":"6a7d7e3f67ba06c3e5da3fd2a17568df61de6f8820120c222566ba8c180dd927","source":{"kind":"arxiv","id":"1209.4383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4383","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4383v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4383","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"NJ6X4P3HXIDM","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NJ6X4P3HXIDMHZO2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NJ6X4P3H","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NJ6X4P3HXIDMHZO2H7JKC5LI35","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-19T22:31:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12ae3605cf99c1473e67394142556fdf5bc9ed90a6616b28ce7d0724f9b29021","abstract_canon_sha256":"a7cdaa4db830e9a5e23f944e860a4e2e63cbf8fc41181c5cb2c71a4dd2a4149a"},"schema_version":"1.0"},"canonical_sha256":"6a7d7e3f67ba06c3e5da3fd2a17568df61de6f8820120c222566ba8c180dd927","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:11.875485Z","signature_b64":"AGXxE36Nvu7LUit7P5vHHu4Fm2i4KEG7uJgWYBIVL7MjMOuiDtOT5a6wrhJ2c+qUbAmikxJUn9hMd/3ZzevFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a7d7e3f67ba06c3e5da3fd2a17568df61de6f8820120c222566ba8c180dd927","last_reissued_at":"2026-05-18T03:45:11.875050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:11.875050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4383","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:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eKS1QcjvdbJLEKtHgAwyTXZ8fMZ1iKy7A9Sbv6TFmYcUwjygRo3yi+7Rahi+Epb2FC7ZQpIYcTDvgxZPFXPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:47:34.597711Z"},"content_sha256":"8cc234264f4b33d0abca3a162371b1646be954336ad14add4f8a05ba0d8a3a2c","schema_version":"1.0","event_id":"sha256:8cc234264f4b33d0abca3a162371b1646be954336ad14add4f8a05ba0d8a3a2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NJ6X4P3HXIDMHZO2H7JKC5LI35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Communication Cost for Joint Distributed Source Coding and Dispersive Information Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emrah Akyol, Kenneth Rose, Kumar Viswanatha","submitted_at":"2012-09-19T22:31:29Z","abstract_excerpt":"This paper considers the problem of minimum cost communication of correlated sources over a network with multiple sinks, which consists of distributed source coding followed by routing. We introduce a new routing paradigm called dispersive information routing, wherein the intermediate nodes are allowed to `split' a packet and forward subsets of the received bits on each of the forward paths. This paradigm opens up a rich class of research problems which focus on the interplay between encoding and routing in a network. Unlike conventional routing methods such as in [1], dispersive information r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4383","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:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjQziQR87eJ13k7OcnUkkL73jFJwCLviIQxdvYbVm24qTpVxIDQtLvB2pNFsPilxsmcVhT66kuW1pthdB/uqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:47:34.598381Z"},"content_sha256":"affcef38af4f1c171cbd2117b0bc93689a84c73261c35f750542c14dea1a24ba","schema_version":"1.0","event_id":"sha256:affcef38af4f1c171cbd2117b0bc93689a84c73261c35f750542c14dea1a24ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/bundle.json","state_url":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/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-09T01:47:34Z","links":{"resolver":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35","bundle":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/bundle.json","state":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NJ6X4P3HXIDMHZO2H7JKC5LI35","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":"a7cdaa4db830e9a5e23f944e860a4e2e63cbf8fc41181c5cb2c71a4dd2a4149a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-19T22:31:29Z","title_canon_sha256":"12ae3605cf99c1473e67394142556fdf5bc9ed90a6616b28ce7d0724f9b29021"},"schema_version":"1.0","source":{"id":"1209.4383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4383","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4383v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4383","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"NJ6X4P3HXIDM","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NJ6X4P3HXIDMHZO2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NJ6X4P3H","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:affcef38af4f1c171cbd2117b0bc93689a84c73261c35f750542c14dea1a24ba","target":"graph","created_at":"2026-05-18T03:45:11Z","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 minimum cost communication of correlated sources over a network with multiple sinks, which consists of distributed source coding followed by routing. We introduce a new routing paradigm called dispersive information routing, wherein the intermediate nodes are allowed to `split' a packet and forward subsets of the received bits on each of the forward paths. This paradigm opens up a rich class of research problems which focus on the interplay between encoding and routing in a network. Unlike conventional routing methods such as in [1], dispersive information r","authors_text":"Emrah Akyol, Kenneth Rose, Kumar Viswanatha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-19T22:31:29Z","title":"Minimum Communication Cost for Joint Distributed Source Coding and Dispersive Information Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4383","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:8cc234264f4b33d0abca3a162371b1646be954336ad14add4f8a05ba0d8a3a2c","target":"record","created_at":"2026-05-18T03:45:11Z","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":"a7cdaa4db830e9a5e23f944e860a4e2e63cbf8fc41181c5cb2c71a4dd2a4149a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-19T22:31:29Z","title_canon_sha256":"12ae3605cf99c1473e67394142556fdf5bc9ed90a6616b28ce7d0724f9b29021"},"schema_version":"1.0","source":{"id":"1209.4383","kind":"arxiv","version":1}},"canonical_sha256":"6a7d7e3f67ba06c3e5da3fd2a17568df61de6f8820120c222566ba8c180dd927","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a7d7e3f67ba06c3e5da3fd2a17568df61de6f8820120c222566ba8c180dd927","first_computed_at":"2026-05-18T03:45:11.875050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:11.875050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AGXxE36Nvu7LUit7P5vHHu4Fm2i4KEG7uJgWYBIVL7MjMOuiDtOT5a6wrhJ2c+qUbAmikxJUn9hMd/3ZzevFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:11.875485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cc234264f4b33d0abca3a162371b1646be954336ad14add4f8a05ba0d8a3a2c","sha256:affcef38af4f1c171cbd2117b0bc93689a84c73261c35f750542c14dea1a24ba"],"state_sha256":"226043ea86cfc6c6663c8f2e9a442de1ce84e0acdf53ea12f736062c75b6e641"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfdMObcMPYu4BhlcXHVSDNsSLAz2tCMsSpYmLW7C6x/D41EK4lhmxTQOix1ItxWre5FtHh+QPcwZb5nWF59ODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:47:34.602068Z","bundle_sha256":"320753610028908e5b1a9499af52e12772fad2b1aedd1703dd9c9d393a29a161"}}