{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:374KMEH65BRNLPM6FCQ34LKGEE","short_pith_number":"pith:374KMEH6","canonical_record":{"source":{"id":"0811.2827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2008-11-18T01:19:37Z","cross_cats_sorted":["cs.CG","cs.NI","physics.soc-ph"],"title_canon_sha256":"a38402adabf530afcb0eb5ce5174e662ebead5739ef81272ee17d5a379b8a8c6","abstract_canon_sha256":"bf385b215165e7577d427abc8b62039df411e1d52f3e58708fbe759a9535519b"},"schema_version":"1.0"},"canonical_sha256":"dff8a610fee862d5bd9e28a1be2d46210eea934e29c3d36084f92ad6593ecb05","source":{"kind":"arxiv","id":"0811.2827","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2827","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2827v3","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2827","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"374KMEH65BRN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"374KMEH65BRNLPM6","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"374KMEH6","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:374KMEH65BRNLPM6FCQ34LKGEE","target":"record","payload":{"canonical_record":{"source":{"id":"0811.2827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2008-11-18T01:19:37Z","cross_cats_sorted":["cs.CG","cs.NI","physics.soc-ph"],"title_canon_sha256":"a38402adabf530afcb0eb5ce5174e662ebead5739ef81272ee17d5a379b8a8c6","abstract_canon_sha256":"bf385b215165e7577d427abc8b62039df411e1d52f3e58708fbe759a9535519b"},"schema_version":"1.0"},"canonical_sha256":"dff8a610fee862d5bd9e28a1be2d46210eea934e29c3d36084f92ad6593ecb05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:44.491455Z","signature_b64":"pd0BbYLMBtG5zvTsX2WVTb99TxmyIMyi5uKmclbQNQM9slF12rW+olLdPOgIxAMkxOM6531Qhubu4HTfPK5rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff8a610fee862d5bd9e28a1be2d46210eea934e29c3d36084f92ad6593ecb05","last_reissued_at":"2026-05-18T04:09:44.490962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:44.490962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.2827","source_version":3,"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:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mz7WmtzPEd5rRZtkFop2nC1A2SW3uryDpH08pGkVr1St5Bl2RJPpI/PCtDbGTuMWNYNB8FD56gfu51XpdPUTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:53:22.886747Z"},"content_sha256":"ff02247a9188c92cf5761547b28e95e39619f5a801ce942bfaad71ffc0000578","schema_version":"1.0","event_id":"sha256:ff02247a9188c92cf5761547b28e95e39619f5a801ce942bfaad71ffc0000578"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:374KMEH65BRNLPM6FCQ34LKGEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.NI","physics.soc-ph"],"primary_cat":"physics.data-an","authors_text":"Yukio Hayashi","submitted_at":"2008-11-18T01:19:37Z","abstract_excerpt":"Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. In this paper, based on a percolation theory and a geometric graph property, we investigate such a design from the following viewpoints: 1) network evolution according to a spatially heterogeneous population, 2) trimodal low degrees for the tolerant connectivity against both failures and attacks, and 3) decentralized routing within short paths. Furthermore, we point out the weakened tolerance by geographical constraints on local cycle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2827","kind":"arxiv","version":3},"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:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylWzLBm5VNEbGTtY4VsLCKfPYm5+LByuU+FAzPOmj8qLnqnikWdjDQiFqPToshA3Ykzjvluu9EBAElSDgmn0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:53:22.887101Z"},"content_sha256":"316a0aca66492886959fcc1bfc4c71b9723aa7082a19854fbb494e730e98a64b","schema_version":"1.0","event_id":"sha256:316a0aca66492886959fcc1bfc4c71b9723aa7082a19854fbb494e730e98a64b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/374KMEH65BRNLPM6FCQ34LKGEE/bundle.json","state_url":"https://pith.science/pith/374KMEH65BRNLPM6FCQ34LKGEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/374KMEH65BRNLPM6FCQ34LKGEE/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-23T14:53:22Z","links":{"resolver":"https://pith.science/pith/374KMEH65BRNLPM6FCQ34LKGEE","bundle":"https://pith.science/pith/374KMEH65BRNLPM6FCQ34LKGEE/bundle.json","state":"https://pith.science/pith/374KMEH65BRNLPM6FCQ34LKGEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/374KMEH65BRNLPM6FCQ34LKGEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:374KMEH65BRNLPM6FCQ34LKGEE","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":"bf385b215165e7577d427abc8b62039df411e1d52f3e58708fbe759a9535519b","cross_cats_sorted":["cs.CG","cs.NI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2008-11-18T01:19:37Z","title_canon_sha256":"a38402adabf530afcb0eb5ce5174e662ebead5739ef81272ee17d5a379b8a8c6"},"schema_version":"1.0","source":{"id":"0811.2827","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2827","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2827v3","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2827","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"374KMEH65BRN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"374KMEH65BRNLPM6","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"374KMEH6","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:316a0aca66492886959fcc1bfc4c71b9723aa7082a19854fbb494e730e98a64b","target":"graph","created_at":"2026-05-18T04:09:44Z","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":"Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. In this paper, based on a percolation theory and a geometric graph property, we investigate such a design from the following viewpoints: 1) network evolution according to a spatially heterogeneous population, 2) trimodal low degrees for the tolerant connectivity against both failures and attacks, and 3) decentralized routing within short paths. Furthermore, we point out the weakened tolerance by geographical constraints on local cycle","authors_text":"Yukio Hayashi","cross_cats":["cs.CG","cs.NI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2008-11-18T01:19:37Z","title":"Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2827","kind":"arxiv","version":3},"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:ff02247a9188c92cf5761547b28e95e39619f5a801ce942bfaad71ffc0000578","target":"record","created_at":"2026-05-18T04:09:44Z","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":"bf385b215165e7577d427abc8b62039df411e1d52f3e58708fbe759a9535519b","cross_cats_sorted":["cs.CG","cs.NI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2008-11-18T01:19:37Z","title_canon_sha256":"a38402adabf530afcb0eb5ce5174e662ebead5739ef81272ee17d5a379b8a8c6"},"schema_version":"1.0","source":{"id":"0811.2827","kind":"arxiv","version":3}},"canonical_sha256":"dff8a610fee862d5bd9e28a1be2d46210eea934e29c3d36084f92ad6593ecb05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dff8a610fee862d5bd9e28a1be2d46210eea934e29c3d36084f92ad6593ecb05","first_computed_at":"2026-05-18T04:09:44.490962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:44.490962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pd0BbYLMBtG5zvTsX2WVTb99TxmyIMyi5uKmclbQNQM9slF12rW+olLdPOgIxAMkxOM6531Qhubu4HTfPK5rCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:44.491455Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.2827","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff02247a9188c92cf5761547b28e95e39619f5a801ce942bfaad71ffc0000578","sha256:316a0aca66492886959fcc1bfc4c71b9723aa7082a19854fbb494e730e98a64b"],"state_sha256":"6a5f53c1705f9584df0b52621d8c5c61275981f5a5081cfc0d3bb13ebfe3d9b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBBdGCp+BXQAWEdtxeV/0cCKA0tKjzcsMDm2wfoa/6NGKdYX6XClCNX14LH+rUCD9kVshwR3flCo4S4ZextXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:53:22.889117Z","bundle_sha256":"40d91a8b90cb638e95bb10b4c2787097bca4eb6f97aae7ba8e689a8f703aef2c"}}