{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZYT4VVTLQANEEIK4AYUFWZN7CL","short_pith_number":"pith:ZYT4VVTL","schema_version":"1.0","canonical_sha256":"ce27cad66b801a42215c06285b65bf12d702fee0c2a640938c04de493a34f33a","source":{"kind":"arxiv","id":"1007.1281","version":4},"attestation_state":"computed","paper":{"title":"Exact Solution for Optimal Navigation with Total Cost Restriction","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Dong Zhou, Jiang Zhang, Yanqing Hu, Yong Li, Zengru Di","submitted_at":"2010-07-08T02:35:31Z","abstract_excerpt":"Recently, Li \\textit{et al.} have concentrated on Kleinberg's navigation model with a certain total length constraint $\\Lambda = cN$, where $N$ is the number of total nodes and $c$ is a constant. Their simulation results for the 1- and 2-dimensional cases indicate that the optimal choice for adding extra long-range connections between any two sites seems to be $\\alpha=d+1$, where $d$ is the dimension of the lattice and $\\alpha$ is the power-law exponent. In this paper, we prove analytically that for the 1-dimensional large networks, the optimal power-law exponent is $\\alpha=2$ Further, we stud"},"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":"1007.1281","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2010-07-08T02:35:31Z","cross_cats_sorted":[],"title_canon_sha256":"f8226fa248df20faf8ac0dc1080627fc3adc690fcfb3d9a37750e884cefdd199","abstract_canon_sha256":"e4d5198b5c7b869d652056fc2f9eca852bf13697a2f7bb201bb5df0eac3f013c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:01.646271Z","signature_b64":"Qr8yjfSO7LmLJzawe6UhPX0DFFPBpkD+KOAQ1SEg23YZBfjBmV7R1a1tSEKOx1FO6xaDNvbFix1C0Y5ybJeoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce27cad66b801a42215c06285b65bf12d702fee0c2a640938c04de493a34f33a","last_reissued_at":"2026-05-18T04:32:01.645605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:01.645605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Solution for Optimal Navigation with Total Cost Restriction","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Dong Zhou, Jiang Zhang, Yanqing Hu, Yong Li, Zengru Di","submitted_at":"2010-07-08T02:35:31Z","abstract_excerpt":"Recently, Li \\textit{et al.} have concentrated on Kleinberg's navigation model with a certain total length constraint $\\Lambda = cN$, where $N$ is the number of total nodes and $c$ is a constant. Their simulation results for the 1- and 2-dimensional cases indicate that the optimal choice for adding extra long-range connections between any two sites seems to be $\\alpha=d+1$, where $d$ is the dimension of the lattice and $\\alpha$ is the power-law exponent. In this paper, we prove analytically that for the 1-dimensional large networks, the optimal power-law exponent is $\\alpha=2$ Further, we stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1281","kind":"arxiv","version":4},"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":"1007.1281","created_at":"2026-05-18T04:32:01.645706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1281v4","created_at":"2026-05-18T04:32:01.645706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1281","created_at":"2026-05-18T04:32:01.645706+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYT4VVTLQANE","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYT4VVTLQANEEIK4","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYT4VVTL","created_at":"2026-05-18T12:26:18.847500+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/ZYT4VVTLQANEEIK4AYUFWZN7CL","json":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL.json","graph_json":"https://pith.science/api/pith-number/ZYT4VVTLQANEEIK4AYUFWZN7CL/graph.json","events_json":"https://pith.science/api/pith-number/ZYT4VVTLQANEEIK4AYUFWZN7CL/events.json","paper":"https://pith.science/paper/ZYT4VVTL"},"agent_actions":{"view_html":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL","download_json":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL.json","view_paper":"https://pith.science/paper/ZYT4VVTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1281&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYT4VVTLQANEEIK4AYUFWZN7CL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYT4VVTLQANEEIK4AYUFWZN7CL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL/action/storage_attestation","attest_author":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL/action/author_attestation","sign_citation":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL/action/citation_signature","submit_replication":"https://pith.science/pith/ZYT4VVTLQANEEIK4AYUFWZN7CL/action/replication_record"}},"created_at":"2026-05-18T04:32:01.645706+00:00","updated_at":"2026-05-18T04:32:01.645706+00:00"}