{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ENYSFH3765ROXWX7JGUWFVZ3IX","short_pith_number":"pith:ENYSFH37","canonical_record":{"source":{"id":"1601.05068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T20:31:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11dcf50eaa874540cfea2f1792246ab123f2724b5b5e0411f8420be174f836ee","abstract_canon_sha256":"1c028fd089a4fdbb8cdb9a6ed51c91c549bae9ff4a30608b82652d4eac0be7d5"},"schema_version":"1.0"},"canonical_sha256":"2371229f7ff762ebdaff49a962d73b45caea7a605b57fbd9a264dc3af2c4a305","source":{"kind":"arxiv","id":"1601.05068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05068","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05068v2","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05068","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ENYSFH3765RO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"ENYSFH3765ROXWX7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"ENYSFH37","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ENYSFH3765ROXWX7JGUWFVZ3IX","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T20:31:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11dcf50eaa874540cfea2f1792246ab123f2724b5b5e0411f8420be174f836ee","abstract_canon_sha256":"1c028fd089a4fdbb8cdb9a6ed51c91c549bae9ff4a30608b82652d4eac0be7d5"},"schema_version":"1.0"},"canonical_sha256":"2371229f7ff762ebdaff49a962d73b45caea7a605b57fbd9a264dc3af2c4a305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:26.460895Z","signature_b64":"g+TftC8w01l2mcPoK5T1eqqDRhrgp+unnT6y9W64Hia/+qxRfIBjT6cUIYKoQOwOUhfy6nKGiVgy5vTgyoMZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2371229f7ff762ebdaff49a962d73b45caea7a605b57fbd9a264dc3af2c4a305","last_reissued_at":"2026-05-18T00:03:26.460212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:26.460212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05068","source_version":2,"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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXaGm5YMp5OD7IoIxu1jb8Ugpt/I8ALwBBansmNAbbIejp1VkzfMj/AAOGlVRkoQPvPLx1+OuwvBrwMoOCnZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:02:01.178262Z"},"content_sha256":"26c7d618c4c6ffd92af488abf4cf120ecbbd5468848c15e60120c6976cde365c","schema_version":"1.0","event_id":"sha256:26c7d618c4c6ffd92af488abf4cf120ecbbd5468848c15e60120c6976cde365c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ENYSFH3765ROXWX7JGUWFVZ3IX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplifying Wireless Social Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Martina Cardone, Mohammed Karmoose","submitted_at":"2016-01-19T20:31:51Z","abstract_excerpt":"Social groups give the opportunity for a new form of caching. In this paper, we investigate how a social group of users can jointly optimize bandwidth usage, by each caching parts of the data demand, and then opportunistically share these parts among themselves upon meeting. We formulate this problem as a Linear Program (LP) with exponential complexity. Based on the optimal solution, we propose a simple heuristic inspired by the bipartite set-cover problem that operates in polynomial time. Furthermore, we prove a worst case gap between the heuristic and the LP solutions. Finally, we assess the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05068","kind":"arxiv","version":2},"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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7byJpDBk8F/DLDfCRGZrX2KEG8CcNZ3NDca92bCt2CWo3ljGXgkikHzScyH7wBRStrQ1pdJiXcPGPWMSuL/GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:02:01.178628Z"},"content_sha256":"ca2608b2f0f1715f438d4ae72e3537d4d9d01fe9a93901d30e542553d203725f","schema_version":"1.0","event_id":"sha256:ca2608b2f0f1715f438d4ae72e3537d4d9d01fe9a93901d30e542553d203725f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENYSFH3765ROXWX7JGUWFVZ3IX/bundle.json","state_url":"https://pith.science/pith/ENYSFH3765ROXWX7JGUWFVZ3IX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENYSFH3765ROXWX7JGUWFVZ3IX/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-25T19:02:01Z","links":{"resolver":"https://pith.science/pith/ENYSFH3765ROXWX7JGUWFVZ3IX","bundle":"https://pith.science/pith/ENYSFH3765ROXWX7JGUWFVZ3IX/bundle.json","state":"https://pith.science/pith/ENYSFH3765ROXWX7JGUWFVZ3IX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENYSFH3765ROXWX7JGUWFVZ3IX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ENYSFH3765ROXWX7JGUWFVZ3IX","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":"1c028fd089a4fdbb8cdb9a6ed51c91c549bae9ff4a30608b82652d4eac0be7d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T20:31:51Z","title_canon_sha256":"11dcf50eaa874540cfea2f1792246ab123f2724b5b5e0411f8420be174f836ee"},"schema_version":"1.0","source":{"id":"1601.05068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05068","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05068v2","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05068","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ENYSFH3765RO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"ENYSFH3765ROXWX7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"ENYSFH37","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:ca2608b2f0f1715f438d4ae72e3537d4d9d01fe9a93901d30e542553d203725f","target":"graph","created_at":"2026-05-18T00:03:26Z","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":"Social groups give the opportunity for a new form of caching. In this paper, we investigate how a social group of users can jointly optimize bandwidth usage, by each caching parts of the data demand, and then opportunistically share these parts among themselves upon meeting. We formulate this problem as a Linear Program (LP) with exponential complexity. Based on the optimal solution, we propose a simple heuristic inspired by the bipartite set-cover problem that operates in polynomial time. Furthermore, we prove a worst case gap between the heuristic and the LP solutions. Finally, we assess the","authors_text":"Christina Fragouli, Martina Cardone, Mohammed Karmoose","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T20:31:51Z","title":"Simplifying Wireless Social Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05068","kind":"arxiv","version":2},"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:26c7d618c4c6ffd92af488abf4cf120ecbbd5468848c15e60120c6976cde365c","target":"record","created_at":"2026-05-18T00:03:26Z","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":"1c028fd089a4fdbb8cdb9a6ed51c91c549bae9ff4a30608b82652d4eac0be7d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T20:31:51Z","title_canon_sha256":"11dcf50eaa874540cfea2f1792246ab123f2724b5b5e0411f8420be174f836ee"},"schema_version":"1.0","source":{"id":"1601.05068","kind":"arxiv","version":2}},"canonical_sha256":"2371229f7ff762ebdaff49a962d73b45caea7a605b57fbd9a264dc3af2c4a305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2371229f7ff762ebdaff49a962d73b45caea7a605b57fbd9a264dc3af2c4a305","first_computed_at":"2026-05-18T00:03:26.460212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:26.460212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g+TftC8w01l2mcPoK5T1eqqDRhrgp+unnT6y9W64Hia/+qxRfIBjT6cUIYKoQOwOUhfy6nKGiVgy5vTgyoMZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:26.460895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26c7d618c4c6ffd92af488abf4cf120ecbbd5468848c15e60120c6976cde365c","sha256:ca2608b2f0f1715f438d4ae72e3537d4d9d01fe9a93901d30e542553d203725f"],"state_sha256":"152d6654bdf504c956b65346523fa7b3474e03c91feca1493c929240a0663503"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8XqOarz3nETF1DrhK4r4z5LqNcv2hM+5yU4yLsT11q5zh/Xcu8qpS0zg7BNPqmyPLzTRU7+4mYG8o84UJmaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:02:01.180598Z","bundle_sha256":"d85402215899e62302516c6474402debdafae380fa06503bbe3cc40fcb51157b"}}