{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FFXSOK6LHVXMRTYKSFAXCPFVCX","short_pith_number":"pith:FFXSOK6L","schema_version":"1.0","canonical_sha256":"296f272bcb3d6ec8cf0a9141713cb515fb4745a18750a440798709e1f505bc6c","source":{"kind":"arxiv","id":"1705.08092","version":3},"attestation_state":"computed","paper":{"title":"An Improved Secretive Coded Caching Scheme exploiting Common Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan","submitted_at":"2017-05-23T06:33:02Z","abstract_excerpt":"Coded caching schemes on broadcast networks with user caches help to offload traffic from peak times to off-peak times by prefetching information from the server to the users during off-peak times and thus serving the users more efficiently during peak times using coded transmissions. We consider the problem of secretive coded caching which was proposed recently, in which a user should not be able to decode any information about any file that the user has not demanded. We propose a new secretive coded caching scheme which has a lower average rate compared to the existing state-of-the-art schem"},"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":"1705.08092","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-23T06:33:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9828cdc067d2c9df0a2787634277e8a8a29843b102686413159019426497d350","abstract_canon_sha256":"b629ad4c52aed43de87e51b997c2e5391a4846c60bf2486d3ed7deb3483526ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:38.471048Z","signature_b64":"SOXHtWjUWQaB7RngsaWk2hADnywbxIpvyJjBPGhc9zzsVkvv7EU54koLxlisCW+u+EF76Zhign0wN6QKnWGBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"296f272bcb3d6ec8cf0a9141713cb515fb4745a18750a440798709e1f505bc6c","last_reissued_at":"2026-05-18T00:36:38.470431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:38.470431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Secretive Coded Caching Scheme exploiting Common Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan","submitted_at":"2017-05-23T06:33:02Z","abstract_excerpt":"Coded caching schemes on broadcast networks with user caches help to offload traffic from peak times to off-peak times by prefetching information from the server to the users during off-peak times and thus serving the users more efficiently during peak times using coded transmissions. We consider the problem of secretive coded caching which was proposed recently, in which a user should not be able to decode any information about any file that the user has not demanded. We propose a new secretive coded caching scheme which has a lower average rate compared to the existing state-of-the-art schem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08092","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":"1705.08092","created_at":"2026-05-18T00:36:38.470525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08092v3","created_at":"2026-05-18T00:36:38.470525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08092","created_at":"2026-05-18T00:36:38.470525+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFXSOK6LHVXM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFXSOK6LHVXMRTYK","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFXSOK6L","created_at":"2026-05-18T12:31:15.632608+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/FFXSOK6LHVXMRTYKSFAXCPFVCX","json":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX.json","graph_json":"https://pith.science/api/pith-number/FFXSOK6LHVXMRTYKSFAXCPFVCX/graph.json","events_json":"https://pith.science/api/pith-number/FFXSOK6LHVXMRTYKSFAXCPFVCX/events.json","paper":"https://pith.science/paper/FFXSOK6L"},"agent_actions":{"view_html":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX","download_json":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX.json","view_paper":"https://pith.science/paper/FFXSOK6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08092&json=true","fetch_graph":"https://pith.science/api/pith-number/FFXSOK6LHVXMRTYKSFAXCPFVCX/graph.json","fetch_events":"https://pith.science/api/pith-number/FFXSOK6LHVXMRTYKSFAXCPFVCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/action/storage_attestation","attest_author":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/action/author_attestation","sign_citation":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/action/citation_signature","submit_replication":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/action/replication_record"}},"created_at":"2026-05-18T00:36:38.470525+00:00","updated_at":"2026-05-18T00:36:38.470525+00:00"}