{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ECJDXGOMJ2CIHPFP4LTUSTN6A7","short_pith_number":"pith:ECJDXGOM","canonical_record":{"source":{"id":"0901.4710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-01-29T16:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"47a55ad9780e77b610a18bee0d891de087dd9f20a27cc5224b4d0c79fe9dabe9","abstract_canon_sha256":"5f6972e620b2a33b755c23dff0ba900f8036afee3cd08fb47b385c0825c8ea95"},"schema_version":"1.0"},"canonical_sha256":"20923b99cc4e8483bcafe2e7494dbe07f74cbece714d60182c4a7c7aac07ac56","source":{"kind":"arxiv","id":"0901.4710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4710","created_at":"2026-05-18T02:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4710v1","created_at":"2026-05-18T02:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4710","created_at":"2026-05-18T02:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"ECJDXGOMJ2CI","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"ECJDXGOMJ2CIHPFP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"ECJDXGOM","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ECJDXGOMJ2CIHPFP4LTUSTN6A7","target":"record","payload":{"canonical_record":{"source":{"id":"0901.4710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-01-29T16:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"47a55ad9780e77b610a18bee0d891de087dd9f20a27cc5224b4d0c79fe9dabe9","abstract_canon_sha256":"5f6972e620b2a33b755c23dff0ba900f8036afee3cd08fb47b385c0825c8ea95"},"schema_version":"1.0"},"canonical_sha256":"20923b99cc4e8483bcafe2e7494dbe07f74cbece714d60182c4a7c7aac07ac56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:55.199967Z","signature_b64":"lOJQEmnLNv5bOIHqkNW8SPTcr4G21gH/Yw78j/fUkpCqtMAFvaphoM8b6yZkCahr3tJHiorX9n+lxPKUgVBGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20923b99cc4e8483bcafe2e7494dbe07f74cbece714d60182c4a7c7aac07ac56","last_reissued_at":"2026-05-18T02:14:55.199153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:55.199153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.4710","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-18T02:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldB7rsoUXGlqGhXslgDlA9wvsDueVfEWyXCsER8j8z9qSy5dFBmN4jrmH/yd8EmO6BxeYtFvUuvuhxzWU0Q2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:38:57.518093Z"},"content_sha256":"ef0dc80a5279ddc2ab201733ba63851ca79278aab346dba3fb402c4023d19fa3","schema_version":"1.0","event_id":"sha256:ef0dc80a5279ddc2ab201733ba63851ca79278aab346dba3fb402c4023d19fa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ECJDXGOMJ2CIHPFP4LTUSTN6A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended navigability of small world networks: exact results and new insights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Cecile Caretta Cartozo, Paolo De Los Rios","submitted_at":"2009-01-29T16:00:45Z","abstract_excerpt":"Navigability of networks, that is the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small-world networks provided that a special recipe was used to establish long range connections, and that a greedy algorithm, that ensures that the destination will be reached, is used. Here we provide an exact solution for the asymptotic behavior of such a greedy algorithm as a function of the system's parameters. Our solution enables us to show that the original claim that on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4710","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-18T02:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YiGPuea+JJyQ4J8+VMxarycsUSLjHuYtdImLV7JQLjXJzpwpEoumY6hy2/L3tXi74ejkcJVb1B/PYjnAF3W9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:38:57.518450Z"},"content_sha256":"cbefa132adca6bf47b99ff587b84d52ec2262b4e8b015860eeeda833440c4420","schema_version":"1.0","event_id":"sha256:cbefa132adca6bf47b99ff587b84d52ec2262b4e8b015860eeeda833440c4420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7/bundle.json","state_url":"https://pith.science/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7/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-03T09:38:57Z","links":{"resolver":"https://pith.science/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7","bundle":"https://pith.science/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7/bundle.json","state":"https://pith.science/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECJDXGOMJ2CIHPFP4LTUSTN6A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ECJDXGOMJ2CIHPFP4LTUSTN6A7","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":"5f6972e620b2a33b755c23dff0ba900f8036afee3cd08fb47b385c0825c8ea95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-01-29T16:00:45Z","title_canon_sha256":"47a55ad9780e77b610a18bee0d891de087dd9f20a27cc5224b4d0c79fe9dabe9"},"schema_version":"1.0","source":{"id":"0901.4710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4710","created_at":"2026-05-18T02:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4710v1","created_at":"2026-05-18T02:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4710","created_at":"2026-05-18T02:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"ECJDXGOMJ2CI","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"ECJDXGOMJ2CIHPFP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"ECJDXGOM","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:cbefa132adca6bf47b99ff587b84d52ec2262b4e8b015860eeeda833440c4420","target":"graph","created_at":"2026-05-18T02:14:55Z","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":"Navigability of networks, that is the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small-world networks provided that a special recipe was used to establish long range connections, and that a greedy algorithm, that ensures that the destination will be reached, is used. Here we provide an exact solution for the asymptotic behavior of such a greedy algorithm as a function of the system's parameters. Our solution enables us to show that the original claim that on","authors_text":"Cecile Caretta Cartozo, Paolo De Los Rios","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-01-29T16:00:45Z","title":"Extended navigability of small world networks: exact results and new insights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4710","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:ef0dc80a5279ddc2ab201733ba63851ca79278aab346dba3fb402c4023d19fa3","target":"record","created_at":"2026-05-18T02:14:55Z","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":"5f6972e620b2a33b755c23dff0ba900f8036afee3cd08fb47b385c0825c8ea95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-01-29T16:00:45Z","title_canon_sha256":"47a55ad9780e77b610a18bee0d891de087dd9f20a27cc5224b4d0c79fe9dabe9"},"schema_version":"1.0","source":{"id":"0901.4710","kind":"arxiv","version":1}},"canonical_sha256":"20923b99cc4e8483bcafe2e7494dbe07f74cbece714d60182c4a7c7aac07ac56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20923b99cc4e8483bcafe2e7494dbe07f74cbece714d60182c4a7c7aac07ac56","first_computed_at":"2026-05-18T02:14:55.199153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:55.199153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lOJQEmnLNv5bOIHqkNW8SPTcr4G21gH/Yw78j/fUkpCqtMAFvaphoM8b6yZkCahr3tJHiorX9n+lxPKUgVBGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:55.199967Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.4710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef0dc80a5279ddc2ab201733ba63851ca79278aab346dba3fb402c4023d19fa3","sha256:cbefa132adca6bf47b99ff587b84d52ec2262b4e8b015860eeeda833440c4420"],"state_sha256":"8af13cada5ae16d7a84ed8a2f5c24555ed4dc3ae80ce3cf3a9a248f500874563"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qk4OjQyQHgyGNyB53xwSh5qyu71i5OsZDWOZ+W4euhVthXxH1swdaC5kYqLydyEs8me2yj08kmZRryhNTrpJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:38:57.520346Z","bundle_sha256":"798cf13a23a4cc44075a135dc8832c89120c73c2eb0e795874891b174ec402c0"}}