{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BB23HYCO7TAUAL5QFZAWPDI2RG","short_pith_number":"pith:BB23HYCO","canonical_record":{"source":{"id":"1811.05864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-14T15:48:33Z","cross_cats_sorted":[],"title_canon_sha256":"87bb343856c02e6cdc420b0f4392fc6fdbc09cc1cda005fdbe7298ca0c30d11b","abstract_canon_sha256":"1f45355480ed310f88f1268f2c911481f1c2c3d893ce428c62bebc07faed8dbc"},"schema_version":"1.0"},"canonical_sha256":"0875b3e04efcc1402fb02e41678d1a89a5cc0d36a659cfd24b7e2f54ece78296","source":{"kind":"arxiv","id":"1811.05864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05864","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05864v1","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05864","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"BB23HYCO7TAU","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BB23HYCO7TAUAL5Q","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BB23HYCO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BB23HYCO7TAUAL5QFZAWPDI2RG","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-14T15:48:33Z","cross_cats_sorted":[],"title_canon_sha256":"87bb343856c02e6cdc420b0f4392fc6fdbc09cc1cda005fdbe7298ca0c30d11b","abstract_canon_sha256":"1f45355480ed310f88f1268f2c911481f1c2c3d893ce428c62bebc07faed8dbc"},"schema_version":"1.0"},"canonical_sha256":"0875b3e04efcc1402fb02e41678d1a89a5cc0d36a659cfd24b7e2f54ece78296","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:41.951047Z","signature_b64":"r7QoRsPd6oLxY+ZC6XuJ4pywLf1UmW2+qwWNpIaJj42kU8g3w3GiWNtEp6LoJpgz5mW/AfMzLKL35c2ErWeABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0875b3e04efcc1402fb02e41678d1a89a5cc0d36a659cfd24b7e2f54ece78296","last_reissued_at":"2026-05-18T00:00:41.950626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:41.950626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05864","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:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPMVj6zuK98LeO/zrNRug+wBgb1/amMuVK4Z+y8nB8kPYo636H0IVAqmiunbYBTyNfsDHuMWQeKCeExZkiTODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:21:29.045336Z"},"content_sha256":"ede0b388502684311924eb88ae0f9df423af7687233dda5401849a52fcd82970","schema_version":"1.0","event_id":"sha256:ede0b388502684311924eb88ae0f9df423af7687233dda5401849a52fcd82970"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BB23HYCO7TAUAL5QFZAWPDI2RG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UtilCache: Effectively and Practicably Reducing Link Cost in Information-Centric Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Lemei Huang, Xinggong Zhang, Yu Guan, Zongming Guo","submitted_at":"2018-11-14T15:48:33Z","abstract_excerpt":"Minimizing total link cost in Information-Centric Network (ICN) by optimizing content placement is challenging in both effectiveness and practicality. To attain better performance, upstream link cost caused by a cache miss should be considered in addition to content popularity. To make it more practicable, a content placement strategy is supposed to be distributed, adaptive, with low coordination overhead as well as low computational complexity. In this paper, we present such a content placement strategy, UtilCache, that is both effective and practicable. UtilCache is compatible with any cache"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05864","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:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4Nd1vWQ0uwi01qqHtV6KNNLiXrenrTqXi+cLCvS6s+N0iCyVFQ/XTYFOrihf7szEFnEMjjpe5/+aVMlNdS2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:21:29.045682Z"},"content_sha256":"002a05fe0a0aadf5017508259a83e4114fcc2af772c4a57f49f56a2ffce33738","schema_version":"1.0","event_id":"sha256:002a05fe0a0aadf5017508259a83e4114fcc2af772c4a57f49f56a2ffce33738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BB23HYCO7TAUAL5QFZAWPDI2RG/bundle.json","state_url":"https://pith.science/pith/BB23HYCO7TAUAL5QFZAWPDI2RG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BB23HYCO7TAUAL5QFZAWPDI2RG/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:21:29Z","links":{"resolver":"https://pith.science/pith/BB23HYCO7TAUAL5QFZAWPDI2RG","bundle":"https://pith.science/pith/BB23HYCO7TAUAL5QFZAWPDI2RG/bundle.json","state":"https://pith.science/pith/BB23HYCO7TAUAL5QFZAWPDI2RG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BB23HYCO7TAUAL5QFZAWPDI2RG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BB23HYCO7TAUAL5QFZAWPDI2RG","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":"1f45355480ed310f88f1268f2c911481f1c2c3d893ce428c62bebc07faed8dbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-14T15:48:33Z","title_canon_sha256":"87bb343856c02e6cdc420b0f4392fc6fdbc09cc1cda005fdbe7298ca0c30d11b"},"schema_version":"1.0","source":{"id":"1811.05864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05864","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05864v1","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05864","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"BB23HYCO7TAU","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BB23HYCO7TAUAL5Q","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BB23HYCO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:002a05fe0a0aadf5017508259a83e4114fcc2af772c4a57f49f56a2ffce33738","target":"graph","created_at":"2026-05-18T00:00:41Z","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":"Minimizing total link cost in Information-Centric Network (ICN) by optimizing content placement is challenging in both effectiveness and practicality. To attain better performance, upstream link cost caused by a cache miss should be considered in addition to content popularity. To make it more practicable, a content placement strategy is supposed to be distributed, adaptive, with low coordination overhead as well as low computational complexity. In this paper, we present such a content placement strategy, UtilCache, that is both effective and practicable. UtilCache is compatible with any cache","authors_text":"Lemei Huang, Xinggong Zhang, Yu Guan, Zongming Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-14T15:48:33Z","title":"UtilCache: Effectively and Practicably Reducing Link Cost in Information-Centric Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05864","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:ede0b388502684311924eb88ae0f9df423af7687233dda5401849a52fcd82970","target":"record","created_at":"2026-05-18T00:00:41Z","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":"1f45355480ed310f88f1268f2c911481f1c2c3d893ce428c62bebc07faed8dbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-14T15:48:33Z","title_canon_sha256":"87bb343856c02e6cdc420b0f4392fc6fdbc09cc1cda005fdbe7298ca0c30d11b"},"schema_version":"1.0","source":{"id":"1811.05864","kind":"arxiv","version":1}},"canonical_sha256":"0875b3e04efcc1402fb02e41678d1a89a5cc0d36a659cfd24b7e2f54ece78296","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0875b3e04efcc1402fb02e41678d1a89a5cc0d36a659cfd24b7e2f54ece78296","first_computed_at":"2026-05-18T00:00:41.950626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:41.950626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7QoRsPd6oLxY+ZC6XuJ4pywLf1UmW2+qwWNpIaJj42kU8g3w3GiWNtEp6LoJpgz5mW/AfMzLKL35c2ErWeABw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:41.951047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ede0b388502684311924eb88ae0f9df423af7687233dda5401849a52fcd82970","sha256:002a05fe0a0aadf5017508259a83e4114fcc2af772c4a57f49f56a2ffce33738"],"state_sha256":"2a16c085c4cf24b1ff936821c226e9e7c368d35d5fad4ed464e32c5acd95bb59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fS/HZFIfhzAsu7EQtPWd6L1cizuoh+fi9fTE6vCvwwZyMpoiCN0F3oMONlTF5BQ9BnX+3OQLXel0HHDmeLH6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:21:29.047718Z","bundle_sha256":"86b41c9b6a6063d1cf5f113e984c6488b6f250de4723a3f90c9122894b41123c"}}