{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HJGX4RHKW6MWPTZCXZRMCGXQES","short_pith_number":"pith:HJGX4RHK","canonical_record":{"source":{"id":"1001.5196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-01-28T15:24:38Z","cross_cats_sorted":["cs.NI","physics.soc-ph"],"title_canon_sha256":"74c7a7288de997c6802975867c1bda4214f0dff15be28a6853c1d107f67f3066","abstract_canon_sha256":"5cd62be9b4ded62a7c5f30daa3e4fe8df971cd9f22359c43e5f109a16a486ba4"},"schema_version":"1.0"},"canonical_sha256":"3a4d7e44eab79967cf22be62c11af024bf8c2261a6b0844d7afff7223560840f","source":{"kind":"arxiv","id":"1001.5196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5196","created_at":"2026-05-18T02:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5196v1","created_at":"2026-05-18T02:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5196","created_at":"2026-05-18T02:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"HJGX4RHKW6MW","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HJGX4RHKW6MWPTZC","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HJGX4RHK","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HJGX4RHKW6MWPTZCXZRMCGXQES","target":"record","payload":{"canonical_record":{"source":{"id":"1001.5196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-01-28T15:24:38Z","cross_cats_sorted":["cs.NI","physics.soc-ph"],"title_canon_sha256":"74c7a7288de997c6802975867c1bda4214f0dff15be28a6853c1d107f67f3066","abstract_canon_sha256":"5cd62be9b4ded62a7c5f30daa3e4fe8df971cd9f22359c43e5f109a16a486ba4"},"schema_version":"1.0"},"canonical_sha256":"3a4d7e44eab79967cf22be62c11af024bf8c2261a6b0844d7afff7223560840f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:28.719909Z","signature_b64":"Y+eOcgfIjkFzwQzEDO3LbnDTNRF0cpxGFnXjQdktkk8jRTfCscZbwBV9lomhvuSNL9zTXeMUSJVGocnLj+FyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a4d7e44eab79967cf22be62c11af024bf8c2261a6b0844d7afff7223560840f","last_reissued_at":"2026-05-18T02:09:28.719389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:28.719389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.5196","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:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2ZSWJEfcV6wuWi46wdWkDG6MOhlKY9+YRLuH/kVZRbGY6mhj2qvX+bNkT73MtGDoS8XX/j8Wmmfdt8BJTTkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:51:32.919780Z"},"content_sha256":"775323a198cdedcd15977795675dba64fb08b1d248b083f6e61da59599a83f7f","schema_version":"1.0","event_id":"sha256:775323a198cdedcd15977795675dba64fb08b1d248b083f6e61da59599a83f7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HJGX4RHKW6MWPTZCXZRMCGXQES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Connectivity of Geographically Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Daniel ben-Avraham, Jie Sun","submitted_at":"2010-01-28T15:24:38Z","abstract_excerpt":"We introduce a measure of {\\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger the higher the proportion of nodes that can be reached from other nodes with a high probability. Greedy connectivity can be used as a criterion for optimal network design."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5196","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:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHyTv/2yK0l/OzxBXqPeUNjxQJrE1MinU2v1LDmr6AWkLuishMQcmMtbHZO50NTx+M1FjdOlKuN45CNAWpBaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:51:32.920122Z"},"content_sha256":"b62ecefc9b8cc3f9db677a2908ca48e5e5d8c35420206a93ee64bd7068fc15bb","schema_version":"1.0","event_id":"sha256:b62ecefc9b8cc3f9db677a2908ca48e5e5d8c35420206a93ee64bd7068fc15bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJGX4RHKW6MWPTZCXZRMCGXQES/bundle.json","state_url":"https://pith.science/pith/HJGX4RHKW6MWPTZCXZRMCGXQES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJGX4RHKW6MWPTZCXZRMCGXQES/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-01T08:51:32Z","links":{"resolver":"https://pith.science/pith/HJGX4RHKW6MWPTZCXZRMCGXQES","bundle":"https://pith.science/pith/HJGX4RHKW6MWPTZCXZRMCGXQES/bundle.json","state":"https://pith.science/pith/HJGX4RHKW6MWPTZCXZRMCGXQES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJGX4RHKW6MWPTZCXZRMCGXQES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HJGX4RHKW6MWPTZCXZRMCGXQES","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":"5cd62be9b4ded62a7c5f30daa3e4fe8df971cd9f22359c43e5f109a16a486ba4","cross_cats_sorted":["cs.NI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-01-28T15:24:38Z","title_canon_sha256":"74c7a7288de997c6802975867c1bda4214f0dff15be28a6853c1d107f67f3066"},"schema_version":"1.0","source":{"id":"1001.5196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5196","created_at":"2026-05-18T02:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5196v1","created_at":"2026-05-18T02:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5196","created_at":"2026-05-18T02:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"HJGX4RHKW6MW","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HJGX4RHKW6MWPTZC","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HJGX4RHK","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:b62ecefc9b8cc3f9db677a2908ca48e5e5d8c35420206a93ee64bd7068fc15bb","target":"graph","created_at":"2026-05-18T02:09:28Z","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":"We introduce a measure of {\\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger the higher the proportion of nodes that can be reached from other nodes with a high probability. Greedy connectivity can be used as a criterion for optimal network design.","authors_text":"Daniel ben-Avraham, Jie Sun","cross_cats":["cs.NI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-01-28T15:24:38Z","title":"Greedy Connectivity of Geographically Embedded Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5196","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:775323a198cdedcd15977795675dba64fb08b1d248b083f6e61da59599a83f7f","target":"record","created_at":"2026-05-18T02:09:28Z","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":"5cd62be9b4ded62a7c5f30daa3e4fe8df971cd9f22359c43e5f109a16a486ba4","cross_cats_sorted":["cs.NI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-01-28T15:24:38Z","title_canon_sha256":"74c7a7288de997c6802975867c1bda4214f0dff15be28a6853c1d107f67f3066"},"schema_version":"1.0","source":{"id":"1001.5196","kind":"arxiv","version":1}},"canonical_sha256":"3a4d7e44eab79967cf22be62c11af024bf8c2261a6b0844d7afff7223560840f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a4d7e44eab79967cf22be62c11af024bf8c2261a6b0844d7afff7223560840f","first_computed_at":"2026-05-18T02:09:28.719389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:28.719389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y+eOcgfIjkFzwQzEDO3LbnDTNRF0cpxGFnXjQdktkk8jRTfCscZbwBV9lomhvuSNL9zTXeMUSJVGocnLj+FyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:28.719909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.5196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:775323a198cdedcd15977795675dba64fb08b1d248b083f6e61da59599a83f7f","sha256:b62ecefc9b8cc3f9db677a2908ca48e5e5d8c35420206a93ee64bd7068fc15bb"],"state_sha256":"2beb189cea5f24af34659e8bc2b7de1c29d594496b71fd13e891d7e118fa9bd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrC4n5YgR5X3TGVEl8vLRdUPAqIeN4RPw3TzI0z9dXc8aIenRIYmV5tHgGd9p3GRtDtQPcJaAd6rC4QzMnzVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:51:32.921996Z","bundle_sha256":"a8efc15d86aba9860e18138c14708649c34305e212ca363bbf2451ec331e738c"}}