{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6IUDEAI3O5AJ2CG4Q5FCVQHAQW","short_pith_number":"pith:6IUDEAI3","canonical_record":{"source":{"id":"1603.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-01T12:08:27Z","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"title_canon_sha256":"7e99d31998ace92e4a59f9af83a0bb1b2667c653d95bebada3f31710b97cb008","abstract_canon_sha256":"bbe685742c9bb5dc89ca2cc9563a34cfcaca783a8313874ec31145f1ea26002b"},"schema_version":"1.0"},"canonical_sha256":"f22832011b77409d08dc874a2ac0e085bbb74623df0e2c2552ce2b9398ae9adc","source":{"kind":"arxiv","id":"1603.00244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00244","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00244v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00244","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"6IUDEAI3O5AJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6IUDEAI3O5AJ2CG4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6IUDEAI3","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6IUDEAI3O5AJ2CG4Q5FCVQHAQW","target":"record","payload":{"canonical_record":{"source":{"id":"1603.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-01T12:08:27Z","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"title_canon_sha256":"7e99d31998ace92e4a59f9af83a0bb1b2667c653d95bebada3f31710b97cb008","abstract_canon_sha256":"bbe685742c9bb5dc89ca2cc9563a34cfcaca783a8313874ec31145f1ea26002b"},"schema_version":"1.0"},"canonical_sha256":"f22832011b77409d08dc874a2ac0e085bbb74623df0e2c2552ce2b9398ae9adc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.857417Z","signature_b64":"lGrxNnjtj780WPGME0soZfMKDm12I4OyF4prcsd9cTb13+xew2AaJa98WAL851BRHkCSYYv43nAD6PSSoFSeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f22832011b77409d08dc874a2ac0e085bbb74623df0e2c2552ce2b9398ae9adc","last_reissued_at":"2026-05-18T00:57:49.856867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.856867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.00244","source_version":1,"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:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aW9Lp/vw7SFElWStlA7a+pTy2EgQTqWUhnGeCyCOj7HfRXMPdZ1GjmVGLwNd482AanoaGSHPA357VI35vBdBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:34:05.560121Z"},"content_sha256":"1877df6c90111fd1805a8fff3f25909b656cd17e8003ac4a8eeef823c3994368","schema_version":"1.0","event_id":"sha256:1877df6c90111fd1805a8fff3f25909b656cd17e8003ac4a8eeef823c3994368"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6IUDEAI3O5AJ2CG4Q5FCVQHAQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Caching Incentive Design in Wireless D2D Networks: A Stackelberg Game Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Zhou, Meixia Tao, Yangyang Liu, Zhuoqun Chen","submitted_at":"2016-03-01T12:08:27Z","abstract_excerpt":"Caching in wireless device-to-device (D2D) networks can be utilized to offload data traffic during peak times. However, the design of incentive mechanisms is challenging due to the heterogeneous preference and selfish nature of user terminals (UTs). In this paper, we propose an incentive mechanism in which the base station (BS) rewards those UTs that share contents with others using D2D communication. We study the cost minimization problem for the BS and the utility maximization problem for each UT. In particular, the BS determines the rewarding policy to minimize his total cost, while each UT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00244","kind":"arxiv","version":1},"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:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGYhwx30rglfSkaYgiKPOflDZm+lIIPEd4Ah+W1f4cRXerMxPcJYfYfo+WY0uWPsqHU2OD9JCQEON+c0ZfG9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:34:05.560807Z"},"content_sha256":"026691056b8b9cb65a8652d6ed7ac0313d317333d5ffc0f79559edf9b5641a31","schema_version":"1.0","event_id":"sha256:026691056b8b9cb65a8652d6ed7ac0313d317333d5ffc0f79559edf9b5641a31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW/bundle.json","state_url":"https://pith.science/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW/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-05-25T22:34:05Z","links":{"resolver":"https://pith.science/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW","bundle":"https://pith.science/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW/bundle.json","state":"https://pith.science/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IUDEAI3O5AJ2CG4Q5FCVQHAQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6IUDEAI3O5AJ2CG4Q5FCVQHAQW","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":"bbe685742c9bb5dc89ca2cc9563a34cfcaca783a8313874ec31145f1ea26002b","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-01T12:08:27Z","title_canon_sha256":"7e99d31998ace92e4a59f9af83a0bb1b2667c653d95bebada3f31710b97cb008"},"schema_version":"1.0","source":{"id":"1603.00244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00244","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00244v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00244","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"6IUDEAI3O5AJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6IUDEAI3O5AJ2CG4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6IUDEAI3","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:026691056b8b9cb65a8652d6ed7ac0313d317333d5ffc0f79559edf9b5641a31","target":"graph","created_at":"2026-05-18T00:57:49Z","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":"Caching in wireless device-to-device (D2D) networks can be utilized to offload data traffic during peak times. However, the design of incentive mechanisms is challenging due to the heterogeneous preference and selfish nature of user terminals (UTs). In this paper, we propose an incentive mechanism in which the base station (BS) rewards those UTs that share contents with others using D2D communication. We study the cost minimization problem for the BS and the utility maximization problem for each UT. In particular, the BS determines the rewarding policy to minimize his total cost, while each UT","authors_text":"Bo Zhou, Meixia Tao, Yangyang Liu, Zhuoqun Chen","cross_cats":["cs.GT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-01T12:08:27Z","title":"Caching Incentive Design in Wireless D2D Networks: A Stackelberg Game Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00244","kind":"arxiv","version":1},"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:1877df6c90111fd1805a8fff3f25909b656cd17e8003ac4a8eeef823c3994368","target":"record","created_at":"2026-05-18T00:57:49Z","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":"bbe685742c9bb5dc89ca2cc9563a34cfcaca783a8313874ec31145f1ea26002b","cross_cats_sorted":["cs.GT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-01T12:08:27Z","title_canon_sha256":"7e99d31998ace92e4a59f9af83a0bb1b2667c653d95bebada3f31710b97cb008"},"schema_version":"1.0","source":{"id":"1603.00244","kind":"arxiv","version":1}},"canonical_sha256":"f22832011b77409d08dc874a2ac0e085bbb74623df0e2c2552ce2b9398ae9adc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f22832011b77409d08dc874a2ac0e085bbb74623df0e2c2552ce2b9398ae9adc","first_computed_at":"2026-05-18T00:57:49.856867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.856867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGrxNnjtj780WPGME0soZfMKDm12I4OyF4prcsd9cTb13+xew2AaJa98WAL851BRHkCSYYv43nAD6PSSoFSeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.857417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1877df6c90111fd1805a8fff3f25909b656cd17e8003ac4a8eeef823c3994368","sha256:026691056b8b9cb65a8652d6ed7ac0313d317333d5ffc0f79559edf9b5641a31"],"state_sha256":"63a49bac48e6c4cf7eed39923892282f4d775586cb3b07766dcaa467020b7839"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxODar50Z91O8WEY3ixXHSsNFKsNb4xcccWG5gUSmJGxYJm24OyVmBbF1m5geHRrBodjTWSZF9zbly/2GJMmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:34:05.564502Z","bundle_sha256":"aee3ba157cea307c330ddc1af86b651c8cc4fdd0b61c4a1e30b99687114aa598"}}