{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T3OIOSHM6D4G2ZKBZMO2RE4KWM","short_pith_number":"pith:T3OIOSHM","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"},"canonical_sha256":"9edc8748ecf0f86d6541cb1da8938ab3108225fc26b8314f9fccd4c3479f8058","source":{"kind":"arxiv","id":"1110.4150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4150","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4150v1","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4150","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"T3OIOSHM6D4G","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T3OIOSHM6D4G2ZKB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T3OIOSHM","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T3OIOSHM6D4G2ZKBZMO2RE4KWM","target":"record","payload":{"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"},"canonical_sha256":"9edc8748ecf0f86d6541cb1da8938ab3108225fc26b8314f9fccd4c3479f8058","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"},"source_kind":"arxiv","source_id":"1110.4150","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-18T04:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IKFY069wPtyWl6c4dFVS6TieaT9YF5CN+9Tgj3IaovdiwXwe9geBMoZ1QthZXc7a/BdH3DT7c0/gXksU6foxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:02:50.787936Z"},"content_sha256":"b28f2c1dc98a6ceb1fa6fe2e3724154382cc11968c9cae65e97989a097592ac1","schema_version":"1.0","event_id":"sha256:b28f2c1dc98a6ceb1fa6fe2e3724154382cc11968c9cae65e97989a097592ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T3OIOSHM6D4G2ZKBZMO2RE4KWM","target":"graph","payload":{"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"},"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-18T04:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoXdKnaNmPjh1u0bdd3VEFf3T4+gExWAzDfEwoYQWYYxy7D4Uwn3Uyrwm9+ByJ1l9Pz3j2G6h1bX4j9oiAgBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:02:50.788287Z"},"content_sha256":"61977b7003e57bbaa5a7e6b55704f4aa57105622225d2ac478aedbdfa0544c9a","schema_version":"1.0","event_id":"sha256:61977b7003e57bbaa5a7e6b55704f4aa57105622225d2ac478aedbdfa0544c9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/bundle.json","state_url":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/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-28T06:02:50Z","links":{"resolver":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM","bundle":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/bundle.json","state":"https://pith.science/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3OIOSHM6D4G2ZKBZMO2RE4KWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T3OIOSHM6D4G2ZKBZMO2RE4KWM","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":"8081afe7465b734d14731b35985779f36ac06cf02d9e932b1aad3682a1f91bd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T00:43:25Z","title_canon_sha256":"b8ab017a324a2898b2df8c1be6c3791d31276c28ffa7d194714bbb3fc0732e87"},"schema_version":"1.0","source":{"id":"1110.4150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4150","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4150v1","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4150","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"T3OIOSHM6D4G","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T3OIOSHM6D4G2ZKB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T3OIOSHM","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:61977b7003e57bbaa5a7e6b55704f4aa57105622225d2ac478aedbdfa0544c9a","target":"graph","created_at":"2026-05-18T04:10:46Z","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":"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 ","authors_text":"Shuchi Chawla, Siddharth Barman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T00:43:25Z","title":"Traffic-Redundancy Aware Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4150","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:b28f2c1dc98a6ceb1fa6fe2e3724154382cc11968c9cae65e97989a097592ac1","target":"record","created_at":"2026-05-18T04:10:46Z","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":"8081afe7465b734d14731b35985779f36ac06cf02d9e932b1aad3682a1f91bd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-19T00:43:25Z","title_canon_sha256":"b8ab017a324a2898b2df8c1be6c3791d31276c28ffa7d194714bbb3fc0732e87"},"schema_version":"1.0","source":{"id":"1110.4150","kind":"arxiv","version":1}},"canonical_sha256":"9edc8748ecf0f86d6541cb1da8938ab3108225fc26b8314f9fccd4c3479f8058","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9edc8748ecf0f86d6541cb1da8938ab3108225fc26b8314f9fccd4c3479f8058","first_computed_at":"2026-05-18T04:10:46.630723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:46.630723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HnIwiiG7kcjIxz0csj50S5XVt13y/mcFNU4gj5dWhf0Fw7y05OdB8BPvNOvPSqVxt8jdAovReufpFcwzQnnDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:46.631099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b28f2c1dc98a6ceb1fa6fe2e3724154382cc11968c9cae65e97989a097592ac1","sha256:61977b7003e57bbaa5a7e6b55704f4aa57105622225d2ac478aedbdfa0544c9a"],"state_sha256":"f9c3cd915848833f6574424aa6c3df49f744c25b00cd78afe0bfbe7af00303b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjQ+Ht0dTs/Zs1ZVeiMNxPYOdrdhbIzokczdRFTHyMPKYbtgPjhG50ac1DWGDR7k48CdaTqLzP5xV6+sW1d2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:02:50.790093Z","bundle_sha256":"cccd584c810357b0271b9c70854a78fd69fed01a6ff3e03b1ba83504e84b8fcf"}}