{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5XSAJLXHQLM3Y5H6YHYGBVXPSK","short_pith_number":"pith:5XSAJLXH","canonical_record":{"source":{"id":"1602.06156","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-19T14:07:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee4c061f25a3f16775860972cd1c37f9df414dc16be06e0059da3cb202769a17","abstract_canon_sha256":"879726740a0c8a4ee13ce5a1b9e8c2813c0c09bef838d6b6f21994401f9994b0"},"schema_version":"1.0"},"canonical_sha256":"ede404aee782d9bc74fec1f060d6ef92bbed5f36d73b6232305ada998cc5680b","source":{"kind":"arxiv","id":"1602.06156","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06156","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06156v3","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06156","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"5XSAJLXHQLM3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5XSAJLXHQLM3Y5H6","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5XSAJLXH","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5XSAJLXHQLM3Y5H6YHYGBVXPSK","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06156","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-19T14:07:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee4c061f25a3f16775860972cd1c37f9df414dc16be06e0059da3cb202769a17","abstract_canon_sha256":"879726740a0c8a4ee13ce5a1b9e8c2813c0c09bef838d6b6f21994401f9994b0"},"schema_version":"1.0"},"canonical_sha256":"ede404aee782d9bc74fec1f060d6ef92bbed5f36d73b6232305ada998cc5680b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.891521Z","signature_b64":"OfNIywAlD9FIUWLiVZkzXIXDn/+km21ptYW5UJLc3HPPpLyjpryrtoUSvuqyGuGJ6Zs5OSJcohIJ2nRMDPxNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede404aee782d9bc74fec1f060d6ef92bbed5f36d73b6232305ada998cc5680b","last_reissued_at":"2026-05-18T01:18:53.891049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.891049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06156","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-18T01:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zk2OL5ZLLYxhSw6MQguFlDPg/pFolCtGks4ibdt2hGY3cn7V6bjOUCG9MDXJz5IC0hpubBtsvUPGMkoFkWleAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:37:22.686042Z"},"content_sha256":"03a97d9f8e3833ad7b02fa5e9217b63041280943c68ff7db99d195ca15b8fb43","schema_version":"1.0","event_id":"sha256:03a97d9f8e3833ad7b02fa5e9217b63041280943c68ff7db99d195ca15b8fb43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5XSAJLXHQLM3Y5H6YHYGBVXPSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Edge Caching with Secrecy Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frederic Gabry, Ingmar Land, Valerio Bioglio","submitted_at":"2016-02-19T14:07:51Z","abstract_excerpt":"In this paper we investigate the problem of optimal cache placement under secrecy constraints in heterogeneous networks, where small-cell base stations are equipped with caches to reduce the overall backhaul load. For two models for eavesdropping attacks, we formally derive the necessary conditions for secrecy and we derive the corresponding achievable backhaul rate. In particular we formulate the optimal caching schemes with secrecy constraints as a convex optimization problem. We then thoroughly investigate the backhaul rate performance of the heterogeneous network with secrecy constraints u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06156","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-18T01:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXKNfjl3VUeKTO0nCy6cYUEiGGQqO56+8sDUGSBfsHpTRyuxJFXMQlukaiccEu6MLEhce5NRYkEZR3yazBVdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:37:22.686441Z"},"content_sha256":"d2032df56128af7badf98e449585159a63e589f81a9fd396701dbffa910e2297","schema_version":"1.0","event_id":"sha256:d2032df56128af7badf98e449585159a63e589f81a9fd396701dbffa910e2297"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK/bundle.json","state_url":"https://pith.science/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK/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-02T11:37:22Z","links":{"resolver":"https://pith.science/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK","bundle":"https://pith.science/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK/bundle.json","state":"https://pith.science/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XSAJLXHQLM3Y5H6YHYGBVXPSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5XSAJLXHQLM3Y5H6YHYGBVXPSK","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":"879726740a0c8a4ee13ce5a1b9e8c2813c0c09bef838d6b6f21994401f9994b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-19T14:07:51Z","title_canon_sha256":"ee4c061f25a3f16775860972cd1c37f9df414dc16be06e0059da3cb202769a17"},"schema_version":"1.0","source":{"id":"1602.06156","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06156","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06156v3","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06156","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"5XSAJLXHQLM3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5XSAJLXHQLM3Y5H6","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5XSAJLXH","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:d2032df56128af7badf98e449585159a63e589f81a9fd396701dbffa910e2297","target":"graph","created_at":"2026-05-18T01:18:53Z","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":"In this paper we investigate the problem of optimal cache placement under secrecy constraints in heterogeneous networks, where small-cell base stations are equipped with caches to reduce the overall backhaul load. For two models for eavesdropping attacks, we formally derive the necessary conditions for secrecy and we derive the corresponding achievable backhaul rate. In particular we formulate the optimal caching schemes with secrecy constraints as a convex optimization problem. We then thoroughly investigate the backhaul rate performance of the heterogeneous network with secrecy constraints u","authors_text":"Frederic Gabry, Ingmar Land, Valerio Bioglio","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-19T14:07:51Z","title":"On Edge Caching with Secrecy Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06156","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:03a97d9f8e3833ad7b02fa5e9217b63041280943c68ff7db99d195ca15b8fb43","target":"record","created_at":"2026-05-18T01:18:53Z","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":"879726740a0c8a4ee13ce5a1b9e8c2813c0c09bef838d6b6f21994401f9994b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-19T14:07:51Z","title_canon_sha256":"ee4c061f25a3f16775860972cd1c37f9df414dc16be06e0059da3cb202769a17"},"schema_version":"1.0","source":{"id":"1602.06156","kind":"arxiv","version":3}},"canonical_sha256":"ede404aee782d9bc74fec1f060d6ef92bbed5f36d73b6232305ada998cc5680b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede404aee782d9bc74fec1f060d6ef92bbed5f36d73b6232305ada998cc5680b","first_computed_at":"2026-05-18T01:18:53.891049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:53.891049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OfNIywAlD9FIUWLiVZkzXIXDn/+km21ptYW5UJLc3HPPpLyjpryrtoUSvuqyGuGJ6Zs5OSJcohIJ2nRMDPxNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:53.891521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06156","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03a97d9f8e3833ad7b02fa5e9217b63041280943c68ff7db99d195ca15b8fb43","sha256:d2032df56128af7badf98e449585159a63e589f81a9fd396701dbffa910e2297"],"state_sha256":"ff1b3dd51e5a6e49636f660b3ee1517a464eaf0efc0f87d259138a68501d47d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dsxn5+IMbZzcQnmwqKb8Dfxew5KOTYqJnmSD+PfWVLiqF8P2WsHT5xKUoukbw+OWMxnSnM5CvjUcGpI0iiS2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:37:22.689089Z","bundle_sha256":"f0bb693acc5e4d5769b308dc5153b8de79d0382b17a5a7f629c64c2760e90b62"}}