{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:I4NWTZYJLDHPWNKICGJZ2HK6GO","short_pith_number":"pith:I4NWTZYJ","canonical_record":{"source":{"id":"1011.5599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-25T11:35:38Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"81cd1962f45a1096bea59ce09abf44738cf513c9983be22dd3241d01d445632d","abstract_canon_sha256":"85b34f76adcc3eae7ee8ac64d21f5b3ebe6c9967776294126e589761e711c01f"},"schema_version":"1.0"},"canonical_sha256":"471b69e70958cefb354811939d1d5e33bc89b65a83c3c31142ce3d79d7d0573a","source":{"kind":"arxiv","id":"1011.5599","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5599","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5599v2","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5599","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"I4NWTZYJLDHP","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"I4NWTZYJLDHPWNKI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"I4NWTZYJ","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:I4NWTZYJLDHPWNKICGJZ2HK6GO","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-25T11:35:38Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"81cd1962f45a1096bea59ce09abf44738cf513c9983be22dd3241d01d445632d","abstract_canon_sha256":"85b34f76adcc3eae7ee8ac64d21f5b3ebe6c9967776294126e589761e711c01f"},"schema_version":"1.0"},"canonical_sha256":"471b69e70958cefb354811939d1d5e33bc89b65a83c3c31142ce3d79d7d0573a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:47.292406Z","signature_b64":"ghD65M7h/x8h7JT5ePd9DPRfSGtTkA4LksEjQW2Zos6v4IwLy022goIrjgTOh9RxhaK2lZGJTwz63gjc5OCtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"471b69e70958cefb354811939d1d5e33bc89b65a83c3c31142ce3d79d7d0573a","last_reissued_at":"2026-05-18T04:30:47.291450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:47.291450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5599","source_version":2,"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-18T04:30:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PbUBXZ06exm0ur4vRsDQyBsrQzKV+RBZgQhDQmQIFgVFzR9LBwKLBNg6e76GDHTAGlD1K0iYDFvULiOW84hAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:24:03.122435Z"},"content_sha256":"3d9ac9c7b5445c8d5972e287fd8f1078b5681e7af285c4268203c667946bc4d5","schema_version":"1.0","event_id":"sha256:3d9ac9c7b5445c8d5972e287fd8f1078b5681e7af285c4268203c667946bc4d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:I4NWTZYJLDHPWNKICGJZ2HK6GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Marco Rosa, Paolo Boldi, Sebastiano Vigna","submitted_at":"2010-11-25T11:35:38Z","abstract_excerpt":"The neighbourhood function N(t) of a graph G gives, for each t, the number of pairs of nodes <x, y> such that y is reachable from x in less that t hops. The neighbourhood function provides a wealth of information about the graph (e.g., it easily allows one to compute its diameter), but it is very expensive to compute it exactly. Recently, the ANF algorithm (approximate neighbourhood function) has been proposed with the purpose of approximating NG(t) on large graphs. We describe a breakthrough improvement over ANF in terms of speed and scalability. Our algorithm, called HyperANF, uses the new H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5599","kind":"arxiv","version":2},"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-18T04:30:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPd/eyNR7+kSrqCGbiFQn/BkHn3kMRTz4jZGpuNiuPhyVPJGAI7FbENAqFDMmtLqjmwY/09s7BUjEr5eeVsiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:24:03.123042Z"},"content_sha256":"b3f71a68bcac09f06dc52316824c3017b7ea3f60ab22f2481946d36bfc12aa98","schema_version":"1.0","event_id":"sha256:b3f71a68bcac09f06dc52316824c3017b7ea3f60ab22f2481946d36bfc12aa98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO/bundle.json","state_url":"https://pith.science/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO/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-04T22:24:03Z","links":{"resolver":"https://pith.science/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO","bundle":"https://pith.science/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO/bundle.json","state":"https://pith.science/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4NWTZYJLDHPWNKICGJZ2HK6GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:I4NWTZYJLDHPWNKICGJZ2HK6GO","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":"85b34f76adcc3eae7ee8ac64d21f5b3ebe6c9967776294126e589761e711c01f","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-25T11:35:38Z","title_canon_sha256":"81cd1962f45a1096bea59ce09abf44738cf513c9983be22dd3241d01d445632d"},"schema_version":"1.0","source":{"id":"1011.5599","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5599","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5599v2","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5599","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"I4NWTZYJLDHP","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"I4NWTZYJLDHPWNKI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"I4NWTZYJ","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:b3f71a68bcac09f06dc52316824c3017b7ea3f60ab22f2481946d36bfc12aa98","target":"graph","created_at":"2026-05-18T04:30:47Z","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":"The neighbourhood function N(t) of a graph G gives, for each t, the number of pairs of nodes <x, y> such that y is reachable from x in less that t hops. The neighbourhood function provides a wealth of information about the graph (e.g., it easily allows one to compute its diameter), but it is very expensive to compute it exactly. Recently, the ANF algorithm (approximate neighbourhood function) has been proposed with the purpose of approximating NG(t) on large graphs. We describe a breakthrough improvement over ANF in terms of speed and scalability. Our algorithm, called HyperANF, uses the new H","authors_text":"Marco Rosa, Paolo Boldi, Sebastiano Vigna","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-25T11:35:38Z","title":"HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5599","kind":"arxiv","version":2},"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:3d9ac9c7b5445c8d5972e287fd8f1078b5681e7af285c4268203c667946bc4d5","target":"record","created_at":"2026-05-18T04:30:47Z","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":"85b34f76adcc3eae7ee8ac64d21f5b3ebe6c9967776294126e589761e711c01f","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-25T11:35:38Z","title_canon_sha256":"81cd1962f45a1096bea59ce09abf44738cf513c9983be22dd3241d01d445632d"},"schema_version":"1.0","source":{"id":"1011.5599","kind":"arxiv","version":2}},"canonical_sha256":"471b69e70958cefb354811939d1d5e33bc89b65a83c3c31142ce3d79d7d0573a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"471b69e70958cefb354811939d1d5e33bc89b65a83c3c31142ce3d79d7d0573a","first_computed_at":"2026-05-18T04:30:47.291450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:47.291450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ghD65M7h/x8h7JT5ePd9DPRfSGtTkA4LksEjQW2Zos6v4IwLy022goIrjgTOh9RxhaK2lZGJTwz63gjc5OCtCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:47.292406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5599","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d9ac9c7b5445c8d5972e287fd8f1078b5681e7af285c4268203c667946bc4d5","sha256:b3f71a68bcac09f06dc52316824c3017b7ea3f60ab22f2481946d36bfc12aa98"],"state_sha256":"96e92ed2d59b292c77eff0559e8f357324d2baa4512932f0c6e52ed5dd488e66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ug/LqHCnsfyMF7O+5tlNSwHZNkE//2bjBuqE2uNnyzbCOl/2Q2qPfEG8UHOFV780DpWNxfiEz7qQwucWZ0EBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:24:03.126305Z","bundle_sha256":"5130adcca6e7f4991303e5ff5a98abf5d35a205756a0f87564557b82ebe142e7"}}