{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:25SG4QB7KKUC4TE5YICXAHPSEZ","short_pith_number":"pith:25SG4QB7","schema_version":"1.0","canonical_sha256":"d7646e403f52a82e4c9dc205701df226500397beb2677782f1dfb472ddef8670","source":{"kind":"arxiv","id":"0908.3869","version":1},"attestation_state":"computed","paper":{"title":"Designing optimal transport networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"A. A. Moreira, G. Li, H. E. Stanley, J. S. Andrade Jr, S. D. S. Reis, S. Havlin","submitted_at":"2009-08-26T17:50:12Z","abstract_excerpt":"We investigate the optimal design of networks for a general transport system. Our network is built from a regular two-dimensional ($d=2$) square lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij} \\sim r_{ij}^{-\\alpha}$, where $r_{ij}$ is the Euclidean distance between sites $i$ and $j$, and $\\alpha$ is a variable exponent. We introduce a cost constraint on the total length of the additional links and find optimal transport in the system for $\\alpha=d+1$. Remarkably, this condition remains optimal, regardless of the strategy used for navigation, being b"},"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":"0908.3869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2009-08-26T17:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"c1963e118a7d15574a31dbca5c7bfcd09b7f4a6b5a62e52ceb3cbc56bda60fc8","abstract_canon_sha256":"3101204618765c810386bb065447ef9488ca18f566af354119265c5de201c77e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:30.708563Z","signature_b64":"e25nvbS4NjcGUCfYmhO9B4pnCPYycU/7EnHk5zjjn0yps5MmHIDv9NnBn6eo9fMG/mi1lF9utjj4eUMI54WNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7646e403f52a82e4c9dc205701df226500397beb2677782f1dfb472ddef8670","last_reissued_at":"2026-05-18T02:53:30.707866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:30.707866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing optimal transport networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"A. A. Moreira, G. Li, H. E. Stanley, J. S. Andrade Jr, S. D. S. Reis, S. Havlin","submitted_at":"2009-08-26T17:50:12Z","abstract_excerpt":"We investigate the optimal design of networks for a general transport system. Our network is built from a regular two-dimensional ($d=2$) square lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij} \\sim r_{ij}^{-\\alpha}$, where $r_{ij}$ is the Euclidean distance between sites $i$ and $j$, and $\\alpha$ is a variable exponent. We introduce a cost constraint on the total length of the additional links and find optimal transport in the system for $\\alpha=d+1$. Remarkably, this condition remains optimal, regardless of the strategy used for navigation, being b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3869","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0908.3869","created_at":"2026-05-18T02:53:30.707960+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3869v1","created_at":"2026-05-18T02:53:30.707960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3869","created_at":"2026-05-18T02:53:30.707960+00:00"},{"alias_kind":"pith_short_12","alias_value":"25SG4QB7KKUC","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"25SG4QB7KKUC4TE5","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"25SG4QB7","created_at":"2026-05-18T12:25:58.018023+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/25SG4QB7KKUC4TE5YICXAHPSEZ","json":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ.json","graph_json":"https://pith.science/api/pith-number/25SG4QB7KKUC4TE5YICXAHPSEZ/graph.json","events_json":"https://pith.science/api/pith-number/25SG4QB7KKUC4TE5YICXAHPSEZ/events.json","paper":"https://pith.science/paper/25SG4QB7"},"agent_actions":{"view_html":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ","download_json":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ.json","view_paper":"https://pith.science/paper/25SG4QB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3869&json=true","fetch_graph":"https://pith.science/api/pith-number/25SG4QB7KKUC4TE5YICXAHPSEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/25SG4QB7KKUC4TE5YICXAHPSEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ/action/storage_attestation","attest_author":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ/action/author_attestation","sign_citation":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ/action/citation_signature","submit_replication":"https://pith.science/pith/25SG4QB7KKUC4TE5YICXAHPSEZ/action/replication_record"}},"created_at":"2026-05-18T02:53:30.707960+00:00","updated_at":"2026-05-18T02:53:30.707960+00:00"}