{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PTQAVYNY2OGA5EZEBTUSMQCVRE","short_pith_number":"pith:PTQAVYNY","canonical_record":{"source":{"id":"1607.03270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-12T09:02:17Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"cb0e6c3aefcf1db5a7c81cd7d9cee6f25ed10c05b0713b75678af6586ee96409","abstract_canon_sha256":"787ccb04332f5d63c06c9c0fa3906799817b428c6f5219307075a3e191cc08f0"},"schema_version":"1.0"},"canonical_sha256":"7ce00ae1b8d38c0e93240ce92640558930583f04d233b48f77fc464b20183580","source":{"kind":"arxiv","id":"1607.03270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03270","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03270v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03270","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"PTQAVYNY2OGA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PTQAVYNY2OGA5EZE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PTQAVYNY","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PTQAVYNY2OGA5EZEBTUSMQCVRE","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-12T09:02:17Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"cb0e6c3aefcf1db5a7c81cd7d9cee6f25ed10c05b0713b75678af6586ee96409","abstract_canon_sha256":"787ccb04332f5d63c06c9c0fa3906799817b428c6f5219307075a3e191cc08f0"},"schema_version":"1.0"},"canonical_sha256":"7ce00ae1b8d38c0e93240ce92640558930583f04d233b48f77fc464b20183580","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:09.402415Z","signature_b64":"uZAcsym0fjCJiGVXIDoSbcbot0/Yo//GFis+BaWZA/H6Uo6gCdxEx5/YFpAAXYYaq885wxffIRLNpT9fWPPbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce00ae1b8d38c0e93240ce92640558930583f04d233b48f77fc464b20183580","last_reissued_at":"2026-05-18T01:11:09.401987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:09.401987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03270","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-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIIZW2NXKYpgsUmXDhww+RYC3hD743avYhSSR5ZYjqPuETZdBqj+xfWCOTYdJdPqsHoDf2lFmuzoIKwPlt0PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:34:57.157430Z"},"content_sha256":"4ad6c74032723109bc5e35939f1beb71711c3f7401c1df4d26996454be408a6c","schema_version":"1.0","event_id":"sha256:4ad6c74032723109bc5e35939f1beb71711c3f7401c1df4d26996454be408a6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PTQAVYNY2OGA5EZEBTUSMQCVRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhanced VIP Algorithms for Forwarding, Caching, and Congestion Control in Named Data Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Edmund Yeh, Fan Lai, Ran Liu, Ying Cui","submitted_at":"2016-07-12T09:02:17Z","abstract_excerpt":"Emerging Information-Centric Networking (ICN) architectures seek to optimally utilize both bandwidth and storage for efficient content distribution over the network. The Virtual Interest Packet (VIP) framework has been proposed to enable joint design of forwarding, caching, and congestion control strategies within the Named Data Networking (NDN) architecture. While the existing VIP algorithms exhibit good performance, they are primarily focused on maximizing network throughput and utility, and do not explicitly consider user delay. In this paper, we develop a new class of enhanced algorithms f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03270","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-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJURpdAIPuSs5eXdBBEdFu42Kd61jNKhuTp7qIiO/Z+k7ayieUR575h90DKI6hSroN2OStzkwizbunFrPYIGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:34:57.157775Z"},"content_sha256":"94b4ec3d61bd08c3bd8a493089a433ff4752a69e89ccfbeba7dc695458ed8853","schema_version":"1.0","event_id":"sha256:94b4ec3d61bd08c3bd8a493089a433ff4752a69e89ccfbeba7dc695458ed8853"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE/bundle.json","state_url":"https://pith.science/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE/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-02T02:34:57Z","links":{"resolver":"https://pith.science/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE","bundle":"https://pith.science/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE/bundle.json","state":"https://pith.science/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTQAVYNY2OGA5EZEBTUSMQCVRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PTQAVYNY2OGA5EZEBTUSMQCVRE","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":"787ccb04332f5d63c06c9c0fa3906799817b428c6f5219307075a3e191cc08f0","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-12T09:02:17Z","title_canon_sha256":"cb0e6c3aefcf1db5a7c81cd7d9cee6f25ed10c05b0713b75678af6586ee96409"},"schema_version":"1.0","source":{"id":"1607.03270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03270","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03270v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03270","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"PTQAVYNY2OGA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PTQAVYNY2OGA5EZE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PTQAVYNY","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:94b4ec3d61bd08c3bd8a493089a433ff4752a69e89ccfbeba7dc695458ed8853","target":"graph","created_at":"2026-05-18T01:11:09Z","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":"Emerging Information-Centric Networking (ICN) architectures seek to optimally utilize both bandwidth and storage for efficient content distribution over the network. The Virtual Interest Packet (VIP) framework has been proposed to enable joint design of forwarding, caching, and congestion control strategies within the Named Data Networking (NDN) architecture. While the existing VIP algorithms exhibit good performance, they are primarily focused on maximizing network throughput and utility, and do not explicitly consider user delay. In this paper, we develop a new class of enhanced algorithms f","authors_text":"Edmund Yeh, Fan Lai, Ran Liu, Ying Cui","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-12T09:02:17Z","title":"Enhanced VIP Algorithms for Forwarding, Caching, and Congestion Control in Named Data Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03270","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:4ad6c74032723109bc5e35939f1beb71711c3f7401c1df4d26996454be408a6c","target":"record","created_at":"2026-05-18T01:11:09Z","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":"787ccb04332f5d63c06c9c0fa3906799817b428c6f5219307075a3e191cc08f0","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-12T09:02:17Z","title_canon_sha256":"cb0e6c3aefcf1db5a7c81cd7d9cee6f25ed10c05b0713b75678af6586ee96409"},"schema_version":"1.0","source":{"id":"1607.03270","kind":"arxiv","version":1}},"canonical_sha256":"7ce00ae1b8d38c0e93240ce92640558930583f04d233b48f77fc464b20183580","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ce00ae1b8d38c0e93240ce92640558930583f04d233b48f77fc464b20183580","first_computed_at":"2026-05-18T01:11:09.401987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:09.401987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uZAcsym0fjCJiGVXIDoSbcbot0/Yo//GFis+BaWZA/H6Uo6gCdxEx5/YFpAAXYYaq885wxffIRLNpT9fWPPbAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:09.402415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ad6c74032723109bc5e35939f1beb71711c3f7401c1df4d26996454be408a6c","sha256:94b4ec3d61bd08c3bd8a493089a433ff4752a69e89ccfbeba7dc695458ed8853"],"state_sha256":"67467e2f80f6a6cb2595a553a2a2241f16d7a73c05d37cd7114814ccc5279d5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vX8AeygS84na6cupK29DCKX/PDSlVOkM8Pogk8SqlOgbLUhFu6UQyhX60n3+mMoFYOcwIGqi+S7f6P3zBoLoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:34:57.159626Z","bundle_sha256":"85c3bbd4c1714a7c94419ed6156a9a2d4400fd402116846a9b610dcb33ef41f8"}}