{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NJ6X4P3HXIDMHZO2H7JKC5LI35","short_pith_number":"pith:NJ6X4P3H","schema_version":"1.0","canonical_sha256":"6a7d7e3f67ba06c3e5da3fd2a17568df61de6f8820120c222566ba8c180dd927","source":{"kind":"arxiv","id":"1209.4383","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.4383","created_at":"2026-05-18T03:45:11.875115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4383v1","created_at":"2026-05-18T03:45:11.875115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4383","created_at":"2026-05-18T03:45:11.875115+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJ6X4P3HXIDM","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJ6X4P3HXIDMHZO2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJ6X4P3H","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35","json":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35.json","graph_json":"https://pith.science/api/pith-number/NJ6X4P3HXIDMHZO2H7JKC5LI35/graph.json","events_json":"https://pith.science/api/pith-number/NJ6X4P3HXIDMHZO2H7JKC5LI35/events.json","paper":"https://pith.science/paper/NJ6X4P3H"},"agent_actions":{"view_html":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35","download_json":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35.json","view_paper":"https://pith.science/paper/NJ6X4P3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4383&json=true","fetch_graph":"https://pith.science/api/pith-number/NJ6X4P3HXIDMHZO2H7JKC5LI35/graph.json","fetch_events":"https://pith.science/api/pith-number/NJ6X4P3HXIDMHZO2H7JKC5LI35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/action/storage_attestation","attest_author":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/action/author_attestation","sign_citation":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/action/citation_signature","submit_replication":"https://pith.science/pith/NJ6X4P3HXIDMHZO2H7JKC5LI35/action/replication_record"}},"created_at":"2026-05-18T03:45:11.875115+00:00","updated_at":"2026-05-18T03:45:11.875115+00:00"}