{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:CVJ4VQCZTAJHGHRZBILKBH3KBA","short_pith_number":"pith:CVJ4VQCZ","schema_version":"1.0","canonical_sha256":"1553cac0599812731e390a16a09f6a081045f56d7cd4fb80414f0d252760e747","source":{"kind":"arxiv","id":"0810.1428","version":2},"attestation_state":"computed","paper":{"title":"Shortest path discovery of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Attila Fekete, G\\'abor Vattay","submitted_at":"2008-10-08T13:28:37Z","abstract_excerpt":"In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network model. We also show that the number of discovered edges in a finite network scales much slower than predicted by earlier mean field models. Finally, we calculate the degree distribution of sampled networks, and we demonstrate that they are analogous to a destructed network obtained by randomly removing edges from the original network."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0810.1428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2008-10-08T13:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"cc96c0e119e7d072a7a4412bf848fc22a511aeff9ab2b8114665bbf938a70c4c","abstract_canon_sha256":"495e01b262f2ab4f47b11a1e5bad0734c3561c0caecc31630204c9d84c936dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:09.534133Z","signature_b64":"G92RLLX9Rjo6se5FqFqG7Ycltdp8kmfeeW69d8tAJZO1ser2EfGQAhR9bEOIjXN7e3Z88g451NjvBmgPwqaABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1553cac0599812731e390a16a09f6a081045f56d7cd4fb80414f0d252760e747","last_reissued_at":"2026-05-18T03:24:09.533367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:09.533367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest path discovery of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Attila Fekete, G\\'abor Vattay","submitted_at":"2008-10-08T13:28:37Z","abstract_excerpt":"In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network model. We also show that the number of discovered edges in a finite network scales much slower than predicted by earlier mean field models. Finally, we calculate the degree distribution of sampled networks, and we demonstrate that they are analogous to a destructed network obtained by randomly removing edges from the original network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.1428","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0810.1428","created_at":"2026-05-18T03:24:09.533487+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.1428v2","created_at":"2026-05-18T03:24:09.533487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.1428","created_at":"2026-05-18T03:24:09.533487+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVJ4VQCZTAJH","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVJ4VQCZTAJHGHRZ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVJ4VQCZ","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA","json":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA.json","graph_json":"https://pith.science/api/pith-number/CVJ4VQCZTAJHGHRZBILKBH3KBA/graph.json","events_json":"https://pith.science/api/pith-number/CVJ4VQCZTAJHGHRZBILKBH3KBA/events.json","paper":"https://pith.science/paper/CVJ4VQCZ"},"agent_actions":{"view_html":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA","download_json":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA.json","view_paper":"https://pith.science/paper/CVJ4VQCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.1428&json=true","fetch_graph":"https://pith.science/api/pith-number/CVJ4VQCZTAJHGHRZBILKBH3KBA/graph.json","fetch_events":"https://pith.science/api/pith-number/CVJ4VQCZTAJHGHRZBILKBH3KBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA/action/storage_attestation","attest_author":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA/action/author_attestation","sign_citation":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA/action/citation_signature","submit_replication":"https://pith.science/pith/CVJ4VQCZTAJHGHRZBILKBH3KBA/action/replication_record"}},"created_at":"2026-05-18T03:24:09.533487+00:00","updated_at":"2026-05-18T03:24:09.533487+00:00"}