{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FD3A4KCI54CVAGY5CTFKBCDCTZ","short_pith_number":"pith:FD3A4KCI","canonical_record":{"source":{"id":"1404.4639","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-17T20:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"b9722d959254f4a520791ed3df84b77e80d52496f08e0abc072676ee15ce636d","abstract_canon_sha256":"6b23b9569e801e91317086e2ed7012e83c06769a9d7744de39529acd52ee07c2"},"schema_version":"1.0"},"canonical_sha256":"28f60e2848ef05501b1d14caa088629e79432aff7da34705c27e247a18128e16","source":{"kind":"arxiv","id":"1404.4639","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4639","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4639v3","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4639","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"FD3A4KCI54CV","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FD3A4KCI54CVAGY5","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FD3A4KCI","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FD3A4KCI54CVAGY5CTFKBCDCTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4639","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-17T20:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"b9722d959254f4a520791ed3df84b77e80d52496f08e0abc072676ee15ce636d","abstract_canon_sha256":"6b23b9569e801e91317086e2ed7012e83c06769a9d7744de39529acd52ee07c2"},"schema_version":"1.0"},"canonical_sha256":"28f60e2848ef05501b1d14caa088629e79432aff7da34705c27e247a18128e16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.610674Z","signature_b64":"GLv82+eUx9uPY1m4ZYkdhfffN+Rb6VBAAEcK5vnF6wK1BooqwdFHoN34kBdk5qG6ZZUfDaVVLpXd+FikhzBfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28f60e2848ef05501b1d14caa088629e79432aff7da34705c27e247a18128e16","last_reissued_at":"2026-05-18T02:44:17.610108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.610108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4639","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-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mpdp98T8RTuw7MWN4BKHfs8oqQUm0WAgUaijU7rcOJKZDhOaRNYXhJI3zYiqk+0iFDOOp4H60Ixufx7+UWqcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:46:11.279438Z"},"content_sha256":"21dd316fe65a06a76719207cab892afbc5e27b8e7c2c8f1b394810dcf37567e3","schema_version":"1.0","event_id":"sha256:21dd316fe65a06a76719207cab892afbc5e27b8e7c2c8f1b394810dcf37567e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FD3A4KCI54CVAGY5CTFKBCDCTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically-Optimal Incentive-Based En-Route Caching Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abdallah Khreishah, Ammar Gharaibeh, Issa Khalil, Jie Wu","submitted_at":"2014-04-17T20:07:36Z","abstract_excerpt":"Content caching at intermediate nodes is a very effective way to optimize the operations of Computer networks, so that future requests can be served without going back to the origin of the content. Several caching techniques have been proposed since the emergence of the concept, including techniques that require major changes to the Internet architecture such as Content Centric Networking. Few of these techniques consider providing caching incentives for the nodes or quality of service guarantees for content owners. In this work, we present a low complexity, distributed, and online algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4639","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-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlC/xTrdbJVToFAYDGj21bZxyXNVnIXNYDGBi0UpkbiAwTdBct5PzgdQBiBp8EVxR3WoWJXOlxDLmzSWabeFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:46:11.279786Z"},"content_sha256":"268d2fc13becb16870188cb0fa9aa8c589a9c9b69948f367a005157710834efa","schema_version":"1.0","event_id":"sha256:268d2fc13becb16870188cb0fa9aa8c589a9c9b69948f367a005157710834efa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ/bundle.json","state_url":"https://pith.science/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ/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-04T06:46:11Z","links":{"resolver":"https://pith.science/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ","bundle":"https://pith.science/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ/bundle.json","state":"https://pith.science/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FD3A4KCI54CVAGY5CTFKBCDCTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FD3A4KCI54CVAGY5CTFKBCDCTZ","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":"6b23b9569e801e91317086e2ed7012e83c06769a9d7744de39529acd52ee07c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-17T20:07:36Z","title_canon_sha256":"b9722d959254f4a520791ed3df84b77e80d52496f08e0abc072676ee15ce636d"},"schema_version":"1.0","source":{"id":"1404.4639","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4639","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4639v3","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4639","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"FD3A4KCI54CV","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FD3A4KCI54CVAGY5","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FD3A4KCI","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:268d2fc13becb16870188cb0fa9aa8c589a9c9b69948f367a005157710834efa","target":"graph","created_at":"2026-05-18T02:44:17Z","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":"Content caching at intermediate nodes is a very effective way to optimize the operations of Computer networks, so that future requests can be served without going back to the origin of the content. Several caching techniques have been proposed since the emergence of the concept, including techniques that require major changes to the Internet architecture such as Content Centric Networking. Few of these techniques consider providing caching incentives for the nodes or quality of service guarantees for content owners. In this work, we present a low complexity, distributed, and online algorithm f","authors_text":"Abdallah Khreishah, Ammar Gharaibeh, Issa Khalil, Jie Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-17T20:07:36Z","title":"Asymptotically-Optimal Incentive-Based En-Route Caching Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4639","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:21dd316fe65a06a76719207cab892afbc5e27b8e7c2c8f1b394810dcf37567e3","target":"record","created_at":"2026-05-18T02:44:17Z","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":"6b23b9569e801e91317086e2ed7012e83c06769a9d7744de39529acd52ee07c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-17T20:07:36Z","title_canon_sha256":"b9722d959254f4a520791ed3df84b77e80d52496f08e0abc072676ee15ce636d"},"schema_version":"1.0","source":{"id":"1404.4639","kind":"arxiv","version":3}},"canonical_sha256":"28f60e2848ef05501b1d14caa088629e79432aff7da34705c27e247a18128e16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28f60e2848ef05501b1d14caa088629e79432aff7da34705c27e247a18128e16","first_computed_at":"2026-05-18T02:44:17.610108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.610108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLv82+eUx9uPY1m4ZYkdhfffN+Rb6VBAAEcK5vnF6wK1BooqwdFHoN34kBdk5qG6ZZUfDaVVLpXd+FikhzBfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.610674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4639","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21dd316fe65a06a76719207cab892afbc5e27b8e7c2c8f1b394810dcf37567e3","sha256:268d2fc13becb16870188cb0fa9aa8c589a9c9b69948f367a005157710834efa"],"state_sha256":"7f6704ab82c1ba3a0a18e72fe4404700a284d536aa2915f936b31ee0fca2e891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbBPfs3XlwLatDxJIpyQtFeNXY1rFHMYPKvQsgDe0AbegAQMe7lK9YVa9wLWCV54/cR1R25UiX1GRzw4OkQCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:46:11.281846Z","bundle_sha256":"9cc9d1544d3a68b5862a45b379cccc3e4258aed3b04d42bfc419e25cc8c1afe0"}}