{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QO6S5A7BHDXE2PR3UEMH7Z3RQQ","short_pith_number":"pith:QO6S5A7B","schema_version":"1.0","canonical_sha256":"83bd2e83e138ee4d3e3ba1187fe771840fae2c27fb8f2477ad5b7e18abd73bb9","source":{"kind":"arxiv","id":"1301.5848","version":3},"attestation_state":"computed","paper":{"title":"Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Ali Maddah-Ali, Urs Niesen","submitted_at":"2013-01-24T17:20:32Z","abstract_excerpt":"Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data available closer to end users. Instead, we recently showed that a much more significant gain can be achieved by using caches to create coded-multicasting opportunities, even for users with different demands, through coding across data streams. These coded-multicasting opportunities are enabled by careful content overlap at the various caches in the net"},"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":"1301.5848","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T17:20:32Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"d3a8671d70f890e453f9790d35efa7e8a2e645946b28eec547145d9a71c93086","abstract_canon_sha256":"b541a2e4ca8eda70ac510e7d7d521fb28806e47eaecc87b0504c7ba072b0c2fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:57.247968Z","signature_b64":"QNzqkbPUrhwcjSek/xahl1+mq4tHg0/bj2Sbh2zFv1bVfM/STJVuTZ9axx1Mo4s4kAwLR0J9v8gJq10TK3YuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83bd2e83e138ee4d3e3ba1187fe771840fae2c27fb8f2477ad5b7e18abd73bb9","last_reissued_at":"2026-05-18T01:33:57.247413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:57.247413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Ali Maddah-Ali, Urs Niesen","submitted_at":"2013-01-24T17:20:32Z","abstract_excerpt":"Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data available closer to end users. Instead, we recently showed that a much more significant gain can be achieved by using caches to create coded-multicasting opportunities, even for users with different demands, through coding across data streams. These coded-multicasting opportunities are enabled by careful content overlap at the various caches in the net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5848","kind":"arxiv","version":3},"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":"1301.5848","created_at":"2026-05-18T01:33:57.247492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5848v3","created_at":"2026-05-18T01:33:57.247492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5848","created_at":"2026-05-18T01:33:57.247492+00:00"},{"alias_kind":"pith_short_12","alias_value":"QO6S5A7BHDXE","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QO6S5A7BHDXE2PR3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QO6S5A7B","created_at":"2026-05-18T12:27:57.521954+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/QO6S5A7BHDXE2PR3UEMH7Z3RQQ","json":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ.json","graph_json":"https://pith.science/api/pith-number/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/graph.json","events_json":"https://pith.science/api/pith-number/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/events.json","paper":"https://pith.science/paper/QO6S5A7B"},"agent_actions":{"view_html":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ","download_json":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ.json","view_paper":"https://pith.science/paper/QO6S5A7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5848&json=true","fetch_graph":"https://pith.science/api/pith-number/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/action/storage_attestation","attest_author":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/action/author_attestation","sign_citation":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/action/citation_signature","submit_replication":"https://pith.science/pith/QO6S5A7BHDXE2PR3UEMH7Z3RQQ/action/replication_record"}},"created_at":"2026-05-18T01:33:57.247492+00:00","updated_at":"2026-05-18T01:33:57.247492+00:00"}