{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZOVQ5HDRRDFCFGK3WTEF6UFZH7","short_pith_number":"pith:ZOVQ5HDR","canonical_record":{"source":{"id":"1809.10948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-28T10:21:19Z","cross_cats_sorted":[],"title_canon_sha256":"8b2d0b2c8d4f99334c5b4cee8196cb27bee98a31c595dcc801009e5819c5560a","abstract_canon_sha256":"772068899be0905f0a77fcdc70661ae7911bb9424a6759c34bf6e33ab2eb597b"},"schema_version":"1.0"},"canonical_sha256":"cbab0e9c7188ca22995bb4c85f50b93fdda884a35f552934c03de222b26ebe9b","source":{"kind":"arxiv","id":"1809.10948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10948","created_at":"2026-05-18T00:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10948v1","created_at":"2026-05-18T00:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10948","created_at":"2026-05-18T00:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZOVQ5HDRRDFC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZOVQ5HDRRDFCFGK3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZOVQ5HDR","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZOVQ5HDRRDFCFGK3WTEF6UFZH7","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-28T10:21:19Z","cross_cats_sorted":[],"title_canon_sha256":"8b2d0b2c8d4f99334c5b4cee8196cb27bee98a31c595dcc801009e5819c5560a","abstract_canon_sha256":"772068899be0905f0a77fcdc70661ae7911bb9424a6759c34bf6e33ab2eb597b"},"schema_version":"1.0"},"canonical_sha256":"cbab0e9c7188ca22995bb4c85f50b93fdda884a35f552934c03de222b26ebe9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:34.529449Z","signature_b64":"co4XTHly0yWbY/Bf2tDpSVSq54TDp/1jiGI+9SBcZ5hRz69yYGB2TRTcly75uhnjZmJkRT4dDylr2gdLN7O+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbab0e9c7188ca22995bb4c85f50b93fdda884a35f552934c03de222b26ebe9b","last_reissued_at":"2026-05-18T00:04:34.528977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:34.528977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10948","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:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lbE4OEjZTra72lQT/vcToJNZQlCLAdWMADpoqiLNsmZpQQ+uwdiOmaBTbLK5PLsXyxOYbYSKsy+LGYVihpYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:15:15.993650Z"},"content_sha256":"1fd852dd3936547e143385619c868f7dd37849c2b4c36dba417bf7bbbc1d1e2d","schema_version":"1.0","event_id":"sha256:1fd852dd3936547e143385619c868f7dd37849c2b4c36dba417bf7bbbc1d1e2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZOVQ5HDRRDFCFGK3WTEF6UFZH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pull-based Bloom Filter-based Routing for Information-Centric Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ali Marandi, Kave Salamatian, Nikolaos Thomos, Torsten Braun","submitted_at":"2018-09-28T10:21:19Z","abstract_excerpt":"In Named Data Networking (NDN), there is a need for routing protocols to populate Forwarding Information Base (FIB) tables so that the Interest messages can be forwarded. To populate FIBs, clients and routers require some routing information. One method to obtain this information is that network nodes exchange routing information by each node advertising the available content objects. Bloom Filter-based Routing approaches like BFR [1], use Bloom Filters (BFs) to advertise all provided content objects, which consumes valuable bandwidth and storage resources. This strategy is inefficient as clie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10948","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:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r49xiN45wfZ8whVdXilvfNVo6omXj2NrfneCLj1/tuvoK3loj9tT2t9sf6PcjcZXkBovjozfe6OFdEZYLh1ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:15:15.993995Z"},"content_sha256":"2ef5a07c44b5c85de49d6052924a29acdb79c3172d070113c4fe78d27de2ee37","schema_version":"1.0","event_id":"sha256:2ef5a07c44b5c85de49d6052924a29acdb79c3172d070113c4fe78d27de2ee37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7/bundle.json","state_url":"https://pith.science/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7/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-22T16:15:15Z","links":{"resolver":"https://pith.science/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7","bundle":"https://pith.science/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7/bundle.json","state":"https://pith.science/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOVQ5HDRRDFCFGK3WTEF6UFZH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZOVQ5HDRRDFCFGK3WTEF6UFZH7","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":"772068899be0905f0a77fcdc70661ae7911bb9424a6759c34bf6e33ab2eb597b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-28T10:21:19Z","title_canon_sha256":"8b2d0b2c8d4f99334c5b4cee8196cb27bee98a31c595dcc801009e5819c5560a"},"schema_version":"1.0","source":{"id":"1809.10948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10948","created_at":"2026-05-18T00:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10948v1","created_at":"2026-05-18T00:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10948","created_at":"2026-05-18T00:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZOVQ5HDRRDFC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZOVQ5HDRRDFCFGK3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZOVQ5HDR","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:2ef5a07c44b5c85de49d6052924a29acdb79c3172d070113c4fe78d27de2ee37","target":"graph","created_at":"2026-05-18T00:04:34Z","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 Named Data Networking (NDN), there is a need for routing protocols to populate Forwarding Information Base (FIB) tables so that the Interest messages can be forwarded. To populate FIBs, clients and routers require some routing information. One method to obtain this information is that network nodes exchange routing information by each node advertising the available content objects. Bloom Filter-based Routing approaches like BFR [1], use Bloom Filters (BFs) to advertise all provided content objects, which consumes valuable bandwidth and storage resources. This strategy is inefficient as clie","authors_text":"Ali Marandi, Kave Salamatian, Nikolaos Thomos, Torsten Braun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-28T10:21:19Z","title":"Pull-based Bloom Filter-based Routing for Information-Centric Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10948","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:1fd852dd3936547e143385619c868f7dd37849c2b4c36dba417bf7bbbc1d1e2d","target":"record","created_at":"2026-05-18T00:04:34Z","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":"772068899be0905f0a77fcdc70661ae7911bb9424a6759c34bf6e33ab2eb597b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-09-28T10:21:19Z","title_canon_sha256":"8b2d0b2c8d4f99334c5b4cee8196cb27bee98a31c595dcc801009e5819c5560a"},"schema_version":"1.0","source":{"id":"1809.10948","kind":"arxiv","version":1}},"canonical_sha256":"cbab0e9c7188ca22995bb4c85f50b93fdda884a35f552934c03de222b26ebe9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbab0e9c7188ca22995bb4c85f50b93fdda884a35f552934c03de222b26ebe9b","first_computed_at":"2026-05-18T00:04:34.528977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:34.528977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"co4XTHly0yWbY/Bf2tDpSVSq54TDp/1jiGI+9SBcZ5hRz69yYGB2TRTcly75uhnjZmJkRT4dDylr2gdLN7O+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:34.529449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fd852dd3936547e143385619c868f7dd37849c2b4c36dba417bf7bbbc1d1e2d","sha256:2ef5a07c44b5c85de49d6052924a29acdb79c3172d070113c4fe78d27de2ee37"],"state_sha256":"e242cd641581302195f82076cb317f1511620954953cf62255e8ed87055a1e30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dz9OfWXi964tyKibrH1WtFhAAojekvCHPQLr0Gud00KafRQ42Z5fs8FbQkgI8xuJByAUJPadDh92HDsVyULYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:15:15.995915Z","bundle_sha256":"ef3c64118b865c5c135bd0e1400e1d9a1203e189700c15d3a5e34041b8f34164"}}