{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3K7GYBH5NBVBADOBR7DPO6JW2I","short_pith_number":"pith:3K7GYBH5","canonical_record":{"source":{"id":"1901.01187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-04T16:02:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d543fe9769af746526cd1a0c0933970e7d27f3126934f426598ac5040b5c532c","abstract_canon_sha256":"b615ab483a058f69b0a43cf91a1169ffbe25587b141cb23bdd2f9a6cdb670bde"},"schema_version":"1.0"},"canonical_sha256":"dabe6c04fd686a100dc18fc6f77936d2203f102fd435f5f7abae565d6a1ae44d","source":{"kind":"arxiv","id":"1901.01187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01187","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01187v1","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01187","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"3K7GYBH5NBVB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3K7GYBH5NBVBADOB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3K7GYBH5","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3K7GYBH5NBVBADOBR7DPO6JW2I","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-04T16:02:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d543fe9769af746526cd1a0c0933970e7d27f3126934f426598ac5040b5c532c","abstract_canon_sha256":"b615ab483a058f69b0a43cf91a1169ffbe25587b141cb23bdd2f9a6cdb670bde"},"schema_version":"1.0"},"canonical_sha256":"dabe6c04fd686a100dc18fc6f77936d2203f102fd435f5f7abae565d6a1ae44d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:56.803044Z","signature_b64":"4OUWV1qlIOOd/pPbviMzVaviLPudWhp+70PPEt+XkpT0KwiYUlaKTEfrT4yhsDm/AMOKanBh49JJKa5z0/GsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabe6c04fd686a100dc18fc6f77936d2203f102fd435f5f7abae565d6a1ae44d","last_reissued_at":"2026-05-17T23:56:56.802575Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:56.802575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01187","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-17T23:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmCWJEOJO83NYMoPt9mf32FQu7JyDkwRpJTEpVw9Sd79iGK7GswHAFFLUcmt+B20XFOI+ZGZKL9POFtnbq1TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:55:14.782164Z"},"content_sha256":"ec95ec0f4ffb49534466f7f4d742e3998ea2d1dd8b8ad1bbf1014d69554e699b","schema_version":"1.0","event_id":"sha256:ec95ec0f4ffb49534466f7f4d742e3998ea2d1dd8b8ad1bbf1014d69554e699b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3K7GYBH5NBVBADOBR7DPO6JW2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PopNetCod: A Popularity-based Caching Policy for Network Coding enabled Named Data Networking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Eirina Bourtsoulatze, Jonnahtan Saltarin, Nikolaos Thomos, Torsten Braun","submitted_at":"2019-01-04T16:02:41Z","abstract_excerpt":"In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data Networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of the content objects by analyzing the requests that it receives. It then uses this information to decide which Data packets to cache or evict from its content store. Since network coding is used, partial caching of content objects is supported, which facilitates the management of the content store. The routers decide the Data packets that they cache or evict in an online manner wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01187","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-17T23:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7Kf5oSSPr4Aw92Rz+sTd2DVxXvMfWbb2KTNEHmT6zEdxOhW8g/U1X1wIXbafKMa6djlHr/UTDbUoKQoOwXPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:55:14.782835Z"},"content_sha256":"d755c18a901790c91e11d72abd77fd08e54ea0fc304502e025b7da84f12643c6","schema_version":"1.0","event_id":"sha256:d755c18a901790c91e11d72abd77fd08e54ea0fc304502e025b7da84f12643c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3K7GYBH5NBVBADOBR7DPO6JW2I/bundle.json","state_url":"https://pith.science/pith/3K7GYBH5NBVBADOBR7DPO6JW2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3K7GYBH5NBVBADOBR7DPO6JW2I/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-06T11:55:14Z","links":{"resolver":"https://pith.science/pith/3K7GYBH5NBVBADOBR7DPO6JW2I","bundle":"https://pith.science/pith/3K7GYBH5NBVBADOBR7DPO6JW2I/bundle.json","state":"https://pith.science/pith/3K7GYBH5NBVBADOBR7DPO6JW2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3K7GYBH5NBVBADOBR7DPO6JW2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3K7GYBH5NBVBADOBR7DPO6JW2I","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":"b615ab483a058f69b0a43cf91a1169ffbe25587b141cb23bdd2f9a6cdb670bde","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-04T16:02:41Z","title_canon_sha256":"d543fe9769af746526cd1a0c0933970e7d27f3126934f426598ac5040b5c532c"},"schema_version":"1.0","source":{"id":"1901.01187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01187","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01187v1","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01187","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"3K7GYBH5NBVB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3K7GYBH5NBVBADOB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3K7GYBH5","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:d755c18a901790c91e11d72abd77fd08e54ea0fc304502e025b7da84f12643c6","target":"graph","created_at":"2026-05-17T23:56:56Z","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":"In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data Networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of the content objects by analyzing the requests that it receives. It then uses this information to decide which Data packets to cache or evict from its content store. Since network coding is used, partial caching of content objects is supported, which facilitates the management of the content store. The routers decide the Data packets that they cache or evict in an online manner wh","authors_text":"Eirina Bourtsoulatze, Jonnahtan Saltarin, Nikolaos Thomos, Torsten Braun","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-04T16:02:41Z","title":"PopNetCod: A Popularity-based Caching Policy for Network Coding enabled Named Data Networking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01187","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:ec95ec0f4ffb49534466f7f4d742e3998ea2d1dd8b8ad1bbf1014d69554e699b","target":"record","created_at":"2026-05-17T23:56:56Z","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":"b615ab483a058f69b0a43cf91a1169ffbe25587b141cb23bdd2f9a6cdb670bde","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-04T16:02:41Z","title_canon_sha256":"d543fe9769af746526cd1a0c0933970e7d27f3126934f426598ac5040b5c532c"},"schema_version":"1.0","source":{"id":"1901.01187","kind":"arxiv","version":1}},"canonical_sha256":"dabe6c04fd686a100dc18fc6f77936d2203f102fd435f5f7abae565d6a1ae44d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dabe6c04fd686a100dc18fc6f77936d2203f102fd435f5f7abae565d6a1ae44d","first_computed_at":"2026-05-17T23:56:56.802575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:56.802575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4OUWV1qlIOOd/pPbviMzVaviLPudWhp+70PPEt+XkpT0KwiYUlaKTEfrT4yhsDm/AMOKanBh49JJKa5z0/GsDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:56.803044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec95ec0f4ffb49534466f7f4d742e3998ea2d1dd8b8ad1bbf1014d69554e699b","sha256:d755c18a901790c91e11d72abd77fd08e54ea0fc304502e025b7da84f12643c6"],"state_sha256":"8e82166a622880bf95b5df2310276211368724d96e9d3253cf1b45485373211b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Grof0V9BLySBV1Ahemrku12xuaxum7uPxjTnH1cZCOYdRohmMTi4xAMcH0onW9cQfGGVq/ALD2sHq0LduDGDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:55:14.785976Z","bundle_sha256":"cecdbfdeea0e82c544873cb99ac850429a3a01e108cad3ccf67b5c3b7e904c65"}}