{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NXNNUIWJEBO3QXE2AQSMLNPQAT","short_pith_number":"pith:NXNNUIWJ","schema_version":"1.0","canonical_sha256":"6ddada22c9205db85c9a0424c5b5f004f41372e6044173ef380a613e801293c7","source":{"kind":"arxiv","id":"1609.00419","version":2},"attestation_state":"computed","paper":{"title":"Spatially Correlated Content Caching for Device-to-Device Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Jeffrey G. Andrews, Mazin Al-Shalash","submitted_at":"2016-09-01T22:55:22Z","abstract_excerpt":"We study optimal geographic content placement for device-to-device (D2D) networks in which each file's popularity follows the Zipf distribution. The locations of the D2D users (caches) are modeled by a Poisson point process (PPP) and have limited communication range and finite storage. Inspired by the Mat\\'{e}rn hard-core (type II) point process that captures pairwise interactions between nodes, we devise a novel spatially correlated caching strategy called {\\em hard-core placement} (HCP) such that the D2D nodes caching the same file are never closer to each other than the {\\em exclusion radiu"},"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":"1609.00419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T22:55:22Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"4035372a1b53123c4c660d822e904de14042dbac8bbf791bec2cea04c2d13fce","abstract_canon_sha256":"4b6b8caeb98fda84661ed8273455b9e04ca6b84a6a8652666776e49d53456d33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:53.160491Z","signature_b64":"6Sn3veENrij2xIc0GTJv8p8oMxNHT+05HHKNZKe+kd2oI3TWl2GIQbngUE7/4Ljlb9MC3X2pz35wlgbSUtABCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ddada22c9205db85c9a0424c5b5f004f41372e6044173ef380a613e801293c7","last_reissued_at":"2026-05-18T00:33:53.160030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:53.160030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially Correlated Content Caching for Device-to-Device Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Jeffrey G. Andrews, Mazin Al-Shalash","submitted_at":"2016-09-01T22:55:22Z","abstract_excerpt":"We study optimal geographic content placement for device-to-device (D2D) networks in which each file's popularity follows the Zipf distribution. The locations of the D2D users (caches) are modeled by a Poisson point process (PPP) and have limited communication range and finite storage. Inspired by the Mat\\'{e}rn hard-core (type II) point process that captures pairwise interactions between nodes, we devise a novel spatially correlated caching strategy called {\\em hard-core placement} (HCP) such that the D2D nodes caching the same file are never closer to each other than the {\\em exclusion radiu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00419","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.00419","created_at":"2026-05-18T00:33:53.160092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00419v2","created_at":"2026-05-18T00:33:53.160092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00419","created_at":"2026-05-18T00:33:53.160092+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXNNUIWJEBO3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXNNUIWJEBO3QXE2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXNNUIWJ","created_at":"2026-05-18T12:30:36.002864+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/NXNNUIWJEBO3QXE2AQSMLNPQAT","json":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT.json","graph_json":"https://pith.science/api/pith-number/NXNNUIWJEBO3QXE2AQSMLNPQAT/graph.json","events_json":"https://pith.science/api/pith-number/NXNNUIWJEBO3QXE2AQSMLNPQAT/events.json","paper":"https://pith.science/paper/NXNNUIWJ"},"agent_actions":{"view_html":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT","download_json":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT.json","view_paper":"https://pith.science/paper/NXNNUIWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00419&json=true","fetch_graph":"https://pith.science/api/pith-number/NXNNUIWJEBO3QXE2AQSMLNPQAT/graph.json","fetch_events":"https://pith.science/api/pith-number/NXNNUIWJEBO3QXE2AQSMLNPQAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT/action/storage_attestation","attest_author":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT/action/author_attestation","sign_citation":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT/action/citation_signature","submit_replication":"https://pith.science/pith/NXNNUIWJEBO3QXE2AQSMLNPQAT/action/replication_record"}},"created_at":"2026-05-18T00:33:53.160092+00:00","updated_at":"2026-05-18T00:33:53.160092+00:00"}