{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FSVXAMJQHA6J34TKBTHK266WWZ","short_pith_number":"pith:FSVXAMJQ","canonical_record":{"source":{"id":"1702.00340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-01T16:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"f77b5dd024a2d398be8631396236ddc9ec76df6bfbe6c988966a03dc60fb4fb2","abstract_canon_sha256":"d8033e98c4a500e8aa81f004924edf2c5ac16c2c0b4b311211242e769a635d4f"},"schema_version":"1.0"},"canonical_sha256":"2cab703130383c9df26a0ccead7bd6b642e2080daa5133a131652ad8818a4cd8","source":{"kind":"arxiv","id":"1702.00340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00340","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00340v1","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00340","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"FSVXAMJQHA6J","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSVXAMJQHA6J34TK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSVXAMJQ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FSVXAMJQHA6J34TKBTHK266WWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-01T16:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"f77b5dd024a2d398be8631396236ddc9ec76df6bfbe6c988966a03dc60fb4fb2","abstract_canon_sha256":"d8033e98c4a500e8aa81f004924edf2c5ac16c2c0b4b311211242e769a635d4f"},"schema_version":"1.0"},"canonical_sha256":"2cab703130383c9df26a0ccead7bd6b642e2080daa5133a131652ad8818a4cd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.596848Z","signature_b64":"YYErfs7ZRw/hK5EDj1iWiaZwIq/TEk8Trqi++TPQJpL7VjpZpbAv9xaHFD5oQ/kSp/Dq3bkjsz0rVrXlx0cPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cab703130383c9df26a0ccead7bd6b642e2080daa5133a131652ad8818a4cd8","last_reissued_at":"2026-05-18T00:51:34.596472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.596472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00340","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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWPRS3+PIk71Xwjy5ywHXBWAEhNRYGrwxqLdSzzbCGVWPStAhCsNTuMLnZ2lA9iYnBTSFpDRh8wmDbp/MsSvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:42:35.703603Z"},"content_sha256":"213bd0341a911926f9087e94cab4cf587b976588120d00176613e6ed977798f4","schema_version":"1.0","event_id":"sha256:213bd0341a911926f9087e94cab4cf587b976588120d00176613e6ed977798f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FSVXAMJQHA6J34TKBTHK266WWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BFR: a Bloom Filter-based Routing Approach 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":"2017-02-01T16:34:21Z","abstract_excerpt":"Locating the demanded content is one of the major challenges in Information-Centric Networking (ICN). This process is known as content discovery. To facilitate content discovery, in this paper we focus on Named Data Networking (NDN) and propose a novel routing scheme for content discovery, called Bloom Filter-based Routing (BFR), which is fully distributed, content oriented, and topology agnostic at the intra-domain level. In BFR, origin servers advertise their content objects using Bloom filters. We compare the performance of the proposed BFR with flooding and shortest path content discovery "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00340","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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBOM3aF+a+ftomC3Pj1mSOGVkR42EPGRLY0c5EKbMEFSFSQFewln1RSJBSVmTYVyqlE3Q0nhMsoBE9pzvovvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:42:35.704095Z"},"content_sha256":"7e1a1cef9fc2feefd10fbc78023b9c0dd0a256dc7725f4c1dea1d71e1c0728a3","schema_version":"1.0","event_id":"sha256:7e1a1cef9fc2feefd10fbc78023b9c0dd0a256dc7725f4c1dea1d71e1c0728a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSVXAMJQHA6J34TKBTHK266WWZ/bundle.json","state_url":"https://pith.science/pith/FSVXAMJQHA6J34TKBTHK266WWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSVXAMJQHA6J34TKBTHK266WWZ/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-07T05:42:35Z","links":{"resolver":"https://pith.science/pith/FSVXAMJQHA6J34TKBTHK266WWZ","bundle":"https://pith.science/pith/FSVXAMJQHA6J34TKBTHK266WWZ/bundle.json","state":"https://pith.science/pith/FSVXAMJQHA6J34TKBTHK266WWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSVXAMJQHA6J34TKBTHK266WWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FSVXAMJQHA6J34TKBTHK266WWZ","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":"d8033e98c4a500e8aa81f004924edf2c5ac16c2c0b4b311211242e769a635d4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-01T16:34:21Z","title_canon_sha256":"f77b5dd024a2d398be8631396236ddc9ec76df6bfbe6c988966a03dc60fb4fb2"},"schema_version":"1.0","source":{"id":"1702.00340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00340","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00340v1","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00340","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"FSVXAMJQHA6J","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSVXAMJQHA6J34TK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSVXAMJQ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:7e1a1cef9fc2feefd10fbc78023b9c0dd0a256dc7725f4c1dea1d71e1c0728a3","target":"graph","created_at":"2026-05-18T00:51: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":"Locating the demanded content is one of the major challenges in Information-Centric Networking (ICN). This process is known as content discovery. To facilitate content discovery, in this paper we focus on Named Data Networking (NDN) and propose a novel routing scheme for content discovery, called Bloom Filter-based Routing (BFR), which is fully distributed, content oriented, and topology agnostic at the intra-domain level. In BFR, origin servers advertise their content objects using Bloom filters. We compare the performance of the proposed BFR with flooding and shortest path content discovery ","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":"2017-02-01T16:34:21Z","title":"BFR: a Bloom Filter-based Routing Approach for Information-Centric Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00340","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:213bd0341a911926f9087e94cab4cf587b976588120d00176613e6ed977798f4","target":"record","created_at":"2026-05-18T00:51: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":"d8033e98c4a500e8aa81f004924edf2c5ac16c2c0b4b311211242e769a635d4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-01T16:34:21Z","title_canon_sha256":"f77b5dd024a2d398be8631396236ddc9ec76df6bfbe6c988966a03dc60fb4fb2"},"schema_version":"1.0","source":{"id":"1702.00340","kind":"arxiv","version":1}},"canonical_sha256":"2cab703130383c9df26a0ccead7bd6b642e2080daa5133a131652ad8818a4cd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cab703130383c9df26a0ccead7bd6b642e2080daa5133a131652ad8818a4cd8","first_computed_at":"2026-05-18T00:51:34.596472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:34.596472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYErfs7ZRw/hK5EDj1iWiaZwIq/TEk8Trqi++TPQJpL7VjpZpbAv9xaHFD5oQ/kSp/Dq3bkjsz0rVrXlx0cPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:34.596848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:213bd0341a911926f9087e94cab4cf587b976588120d00176613e6ed977798f4","sha256:7e1a1cef9fc2feefd10fbc78023b9c0dd0a256dc7725f4c1dea1d71e1c0728a3"],"state_sha256":"6b223fbd304784211e74bc0a5294e9ef24888561a3ca96a31a27d616444f8c3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFz/6HRgWk1cjfS2LWWTBh/KmvLsVkj1ay4aZTNgAmf1WpdRWEp86OeQ3599Eqcjjl/Y+siUqLVGF/rmcusJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:42:35.707440Z","bundle_sha256":"78f049188703254ebfb0edab086d74f9d6686a0a0338da05eafaf448c81fb95f"}}