{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FFXSOK6LHVXMRTYKSFAXCPFVCX","short_pith_number":"pith:FFXSOK6L","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"},"canonical_sha256":"296f272bcb3d6ec8cf0a9141713cb515fb4745a18750a440798709e1f505bc6c","source":{"kind":"arxiv","id":"1705.08092","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08092","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08092v3","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08092","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"FFXSOK6LHVXM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFXSOK6LHVXMRTYK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFXSOK6L","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FFXSOK6LHVXMRTYKSFAXCPFVCX","target":"record","payload":{"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"},"canonical_sha256":"296f272bcb3d6ec8cf0a9141713cb515fb4745a18750a440798709e1f505bc6c","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"},"source_kind":"arxiv","source_id":"1705.08092","source_version":3,"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-18T00:36:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TB/K8wgXtDjr/cd9ELWhjy+zse3AOxDA2JzigTqbmG4Wn5wzz6Pia2ZSECXXgurF9x0ncxj35qc5LrjLjm6EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:08:15.258272Z"},"content_sha256":"c068f391ea6a99eafee2d921216850b5e7b8310df3f6edc19841520d9aa308ec","schema_version":"1.0","event_id":"sha256:c068f391ea6a99eafee2d921216850b5e7b8310df3f6edc19841520d9aa308ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FFXSOK6LHVXMRTYKSFAXCPFVCX","target":"graph","payload":{"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"},"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-18T00:36:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0VQ3jqXi7PT8S4n8Py4oV2eeOmMeBPGV6UcljFicAjZydBYJ0Gk1lnTI75nP+DiOGqnLJ8IpSN712BUF4fgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:08:15.258638Z"},"content_sha256":"03c5a604de146d7f6af8e5d64b7b72b5ffcc689fd4c17f097b88d503da39507d","schema_version":"1.0","event_id":"sha256:03c5a604de146d7f6af8e5d64b7b72b5ffcc689fd4c17f097b88d503da39507d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/bundle.json","state_url":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/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-23T15:08:15Z","links":{"resolver":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX","bundle":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/bundle.json","state":"https://pith.science/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFXSOK6LHVXMRTYKSFAXCPFVCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FFXSOK6LHVXMRTYKSFAXCPFVCX","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":"b629ad4c52aed43de87e51b997c2e5391a4846c60bf2486d3ed7deb3483526ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-23T06:33:02Z","title_canon_sha256":"9828cdc067d2c9df0a2787634277e8a8a29843b102686413159019426497d350"},"schema_version":"1.0","source":{"id":"1705.08092","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08092","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08092v3","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08092","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"FFXSOK6LHVXM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFXSOK6LHVXMRTYK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFXSOK6L","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:03c5a604de146d7f6af8e5d64b7b72b5ffcc689fd4c17f097b88d503da39507d","target":"graph","created_at":"2026-05-18T00:36:38Z","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":"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","authors_text":"Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-23T06:33:02Z","title":"An Improved Secretive Coded Caching Scheme exploiting Common Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08092","kind":"arxiv","version":3},"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:c068f391ea6a99eafee2d921216850b5e7b8310df3f6edc19841520d9aa308ec","target":"record","created_at":"2026-05-18T00:36:38Z","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":"b629ad4c52aed43de87e51b997c2e5391a4846c60bf2486d3ed7deb3483526ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-23T06:33:02Z","title_canon_sha256":"9828cdc067d2c9df0a2787634277e8a8a29843b102686413159019426497d350"},"schema_version":"1.0","source":{"id":"1705.08092","kind":"arxiv","version":3}},"canonical_sha256":"296f272bcb3d6ec8cf0a9141713cb515fb4745a18750a440798709e1f505bc6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"296f272bcb3d6ec8cf0a9141713cb515fb4745a18750a440798709e1f505bc6c","first_computed_at":"2026-05-18T00:36:38.470431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:38.470431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SOXHtWjUWQaB7RngsaWk2hADnywbxIpvyJjBPGhc9zzsVkvv7EU54koLxlisCW+u+EF76Zhign0wN6QKnWGBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:38.471048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08092","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c068f391ea6a99eafee2d921216850b5e7b8310df3f6edc19841520d9aa308ec","sha256:03c5a604de146d7f6af8e5d64b7b72b5ffcc689fd4c17f097b88d503da39507d"],"state_sha256":"5c603ac27f42c9de8dc1b0f2cbfed2091c173cbf4c134c55b64e9320644d40ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYV357MAdQ4Reoacxl02QQXF8jZY/cWQ6xCv8RxeCU9qKSy/KrKoVyCKtw5TQkX6xF0obLbxjv4BLMIb4uWdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:08:15.260521Z","bundle_sha256":"37394a91704cbb88b95de319ea41ba4f1d821a312b3005d5d4ccd940522ac126"}}