{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:T3OIOSHM6D4G2ZKBZMO2RE4KWM","short_pith_number":"pith:T3OIOSHM","schema_version":"1.0","canonical_sha256":"9edc8748ecf0f86d6541cb1da8938ab3108225fc26b8314f9fccd4c3479f8058","source":{"kind":"arxiv","id":"1110.4150","version":1},"attestation_state":"computed","paper":{"title":"Traffic-Redundancy Aware Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shuchi Chawla, Siddharth Barman","submitted_at":"2011-10-19T00:43:25Z","abstract_excerpt":"We consider network design problems for information networks where routers can replicate data but cannot alter it. This functionality allows the network to eliminate data-redundancy in traffic, thereby saving on routing costs. We consider two problems within this framework and design approximation algorithms.\n  The first problem we study is the traffic-redundancy aware network design (RAND) problem. We are given a weighted graph over a single server and many clients. The server owns a number of different data packets and each client desires a subset of the packets; the client demand sets form "},"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":"1110.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T00:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"b8ab017a324a2898b2df8c1be6c3791d31276c28ffa7d194714bbb3fc0732e87","abstract_canon_sha256":"8081afe7465b734d14731b35985779f36ac06cf02d9e932b1aad3682a1f91bd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:46.631099Z","signature_b64":"HnIwiiG7kcjIxz0csj50S5XVt13y/mcFNU4gj5dWhf0Fw7y05OdB8BPvNOvPSqVxt8jdAovReufpFcwzQnnDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9edc8748ecf0f86d6541cb1da8938ab3108225fc26b8314f9fccd4c3479f8058","last_reissued_at":"2026-05-18T04:10:46.630723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:46.630723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Traffic-Redundancy Aware Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shuchi Chawla, Siddharth Barman","submitted_at":"2011-10-19T00:43:25Z","abstract_excerpt":"We consider network design problems for information networks where routers can replicate data but cannot alter it. This functionality allows the network to eliminate data-redundancy in traffic, thereby saving on routing costs. We consider two problems within this framework and design approximation algorithms.\n  The first problem we study is the traffic-redundancy aware network design (RAND) problem. We are given a weighted graph over a single server and many clients. The server owns a number of different data packets and each client desires a subset of the packets; the client demand sets form "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4150","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":"1110.4150","created_at":"2026-05-18T04:10:46.630788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4150v1","created_at":"2026-05-18T04:10:46.630788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4150","created_at":"2026-05-18T04:10:46.630788+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3OIOSHM6D4G","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3OIOSHM6D4G2ZKB","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3OIOSHM","created_at":"2026-05-18T12:26:41.206345+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/T3OIOSHM6D4G2ZKBZMO2RE4KWM","json":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM.json","graph_json":"https://pith.science/api/pith-number/T3OIOSHM6D4G2ZKBZMO2RE4KWM/graph.json","events_json":"https://pith.science/api/pith-number/T3OIOSHM6D4G2ZKBZMO2RE4KWM/events.json","paper":"https://pith.science/paper/T3OIOSHM"},"agent_actions":{"view_html":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM","download_json":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM.json","view_paper":"https://pith.science/paper/T3OIOSHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4150&json=true","fetch_graph":"https://pith.science/api/pith-number/T3OIOSHM6D4G2ZKBZMO2RE4KWM/graph.json","fetch_events":"https://pith.science/api/pith-number/T3OIOSHM6D4G2ZKBZMO2RE4KWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/action/storage_attestation","attest_author":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/action/author_attestation","sign_citation":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/action/citation_signature","submit_replication":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/action/replication_record"}},"created_at":"2026-05-18T04:10:46.630788+00:00","updated_at":"2026-05-18T04:10:46.630788+00:00"}