{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WVRILA5LZKLOZILFZ6LZZLDOZV","short_pith_number":"pith:WVRILA5L","schema_version":"1.0","canonical_sha256":"b5628583abca96eca165cf979cac6ecd49214a414c398561db8d12239b8dad1e","source":{"kind":"arxiv","id":"1910.08268","version":1},"attestation_state":"computed","paper":{"title":"Secure Coded Caching with Colluding Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kangning Ma, Shuo Shao","submitted_at":"2019-10-18T05:15:09Z","abstract_excerpt":"In a secure coded caching system, a central server balances the traffic flow between peak and off-peak periods by distributing some public data to the users' caches in advance. Meanwhile, these data are securely protected against the possible colluding users, who might share their cache. We model the system as a flow network and study its capacity region via a network information-theoretic approach. Due to the difficulty of characterizing the capacity region straightforwardly, our approach is two folded from the perspective of network information theory. On one hand, we identify the inner boun"},"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":"1910.08268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-10-18T05:15:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95b7bb8f8ac9ad8d774862fe9f7b2105d5b6d48f87a4ff6a6827a8a0e17fab36","abstract_canon_sha256":"8eda2ec93963213c2ed472ef77689ac57829d5747e5df4259556bc31e4856efb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:07.296398Z","signature_b64":"rdB7gsbTPOuIYM2lpYbNnqrCv/dilkbgXkX7gAt0WPlRDu5aC2hswCfIdzkfM/YXM7GPAcOwUIqbNwhpkbVcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5628583abca96eca165cf979cac6ecd49214a414c398561db8d12239b8dad1e","last_reissued_at":"2026-07-05T00:13:07.295857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:07.295857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Coded Caching with Colluding Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kangning Ma, Shuo Shao","submitted_at":"2019-10-18T05:15:09Z","abstract_excerpt":"In a secure coded caching system, a central server balances the traffic flow between peak and off-peak periods by distributing some public data to the users' caches in advance. Meanwhile, these data are securely protected against the possible colluding users, who might share their cache. We model the system as a flow network and study its capacity region via a network information-theoretic approach. Due to the difficulty of characterizing the capacity region straightforwardly, our approach is two folded from the perspective of network information theory. On one hand, we identify the inner boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08268","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.08268/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.08268","created_at":"2026-07-05T00:13:07.295916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.08268v1","created_at":"2026-07-05T00:13:07.295916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08268","created_at":"2026-07-05T00:13:07.295916+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVRILA5LZKLO","created_at":"2026-07-05T00:13:07.295916+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVRILA5LZKLOZILF","created_at":"2026-07-05T00:13:07.295916+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVRILA5L","created_at":"2026-07-05T00:13:07.295916+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13961","citing_title":"Secretive Hotplug Coded Caching","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV","json":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV.json","graph_json":"https://pith.science/api/pith-number/WVRILA5LZKLOZILFZ6LZZLDOZV/graph.json","events_json":"https://pith.science/api/pith-number/WVRILA5LZKLOZILFZ6LZZLDOZV/events.json","paper":"https://pith.science/paper/WVRILA5L"},"agent_actions":{"view_html":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV","download_json":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV.json","view_paper":"https://pith.science/paper/WVRILA5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.08268&json=true","fetch_graph":"https://pith.science/api/pith-number/WVRILA5LZKLOZILFZ6LZZLDOZV/graph.json","fetch_events":"https://pith.science/api/pith-number/WVRILA5LZKLOZILFZ6LZZLDOZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV/action/storage_attestation","attest_author":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV/action/author_attestation","sign_citation":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV/action/citation_signature","submit_replication":"https://pith.science/pith/WVRILA5LZKLOZILFZ6LZZLDOZV/action/replication_record"}},"created_at":"2026-07-05T00:13:07.295916+00:00","updated_at":"2026-07-05T00:13:07.295916+00:00"}