{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KCRAIPFOUGZSTBZT25E2UBFNE2","short_pith_number":"pith:KCRAIPFO","canonical_record":{"source":{"id":"1604.01575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-04-06T11:26:18Z","cross_cats_sorted":["cs.SI","math.PR","math.ST","physics.soc-ph","stat.TH"],"title_canon_sha256":"76387047e1971b4d2e5567cc16dcf13dcf01d84a8e967a8bda9fc0a3f5ec94b5","abstract_canon_sha256":"6663758c424beb11cbff0e1a754f70c0e157cb3e97b8a02a02e221070d9be791"},"schema_version":"1.0"},"canonical_sha256":"50a2043caea1b3298733d749aa04ad26bc1fd0095b4871e6ec32c1e5ed62baa8","source":{"kind":"arxiv","id":"1604.01575","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01575","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01575v2","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01575","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"KCRAIPFOUGZS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KCRAIPFOUGZSTBZT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KCRAIPFO","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KCRAIPFOUGZSTBZT25E2UBFNE2","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-04-06T11:26:18Z","cross_cats_sorted":["cs.SI","math.PR","math.ST","physics.soc-ph","stat.TH"],"title_canon_sha256":"76387047e1971b4d2e5567cc16dcf13dcf01d84a8e967a8bda9fc0a3f5ec94b5","abstract_canon_sha256":"6663758c424beb11cbff0e1a754f70c0e157cb3e97b8a02a02e221070d9be791"},"schema_version":"1.0"},"canonical_sha256":"50a2043caea1b3298733d749aa04ad26bc1fd0095b4871e6ec32c1e5ed62baa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:20.366553Z","signature_b64":"MkHz+Zyo/Zp88fajMKdk1Oz05sEEKMv9NTOn7vr2GZCl0/X8ZpQ4Nuu/inbansrJjJDvWB0yNiEJbLrtP83wBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50a2043caea1b3298733d749aa04ad26bc1fd0095b4871e6ec32c1e5ed62baa8","last_reissued_at":"2026-05-18T01:14:20.365753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:20.365753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01575","source_version":2,"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-18T01:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLncVP51MUjHPafpk6euXgMd6uFSnvMHvS1RcQrOp9MqPmiJsf5CfqSmZ72sNxQrGgagSbPdK4NmmkaIlDZ7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:00:50.858024Z"},"content_sha256":"91d6fd232b0faa8623319a78578d63bd1437b4facaea483436764ebce47128f8","schema_version":"1.0","event_id":"sha256:91d6fd232b0faa8623319a78578d63bd1437b4facaea483436764ebce47128f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KCRAIPFOUGZSTBZT25E2UBFNE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering implies geometry in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR","math.ST","physics.soc-ph","stat.TH"],"primary_cat":"cond-mat.stat-mech","authors_text":"Dmitri Krioukov","submitted_at":"2016-04-06T11:26:18Z","abstract_excerpt":"Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in an ensemble of random geometric graphs. Here we identify structural properties of networks that guarantee that random graphs having these properties are geometric. Specifically we show that random graphs in which expected degree and clustering of every node are fixed to some constants are equivalent to random geometric graphs on the real line, if clustering "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01575","kind":"arxiv","version":2},"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-18T01:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoAeErI9pLP834f3aY21FoF12ljOtsmU1MabvaC7sZEEWXTdLlpog6AHDH5xTuydGZU1PZ4Jvl40dqacR/oTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:00:50.858778Z"},"content_sha256":"53fe85842de7c3c4f9c614d5c5bb78448889d9cc3ec6ff4e6b6af561625b3942","schema_version":"1.0","event_id":"sha256:53fe85842de7c3c4f9c614d5c5bb78448889d9cc3ec6ff4e6b6af561625b3942"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCRAIPFOUGZSTBZT25E2UBFNE2/bundle.json","state_url":"https://pith.science/pith/KCRAIPFOUGZSTBZT25E2UBFNE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCRAIPFOUGZSTBZT25E2UBFNE2/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-09T08:00:50Z","links":{"resolver":"https://pith.science/pith/KCRAIPFOUGZSTBZT25E2UBFNE2","bundle":"https://pith.science/pith/KCRAIPFOUGZSTBZT25E2UBFNE2/bundle.json","state":"https://pith.science/pith/KCRAIPFOUGZSTBZT25E2UBFNE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCRAIPFOUGZSTBZT25E2UBFNE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KCRAIPFOUGZSTBZT25E2UBFNE2","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":"6663758c424beb11cbff0e1a754f70c0e157cb3e97b8a02a02e221070d9be791","cross_cats_sorted":["cs.SI","math.PR","math.ST","physics.soc-ph","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-04-06T11:26:18Z","title_canon_sha256":"76387047e1971b4d2e5567cc16dcf13dcf01d84a8e967a8bda9fc0a3f5ec94b5"},"schema_version":"1.0","source":{"id":"1604.01575","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01575","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01575v2","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01575","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"KCRAIPFOUGZS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KCRAIPFOUGZSTBZT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KCRAIPFO","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:53fe85842de7c3c4f9c614d5c5bb78448889d9cc3ec6ff4e6b6af561625b3942","target":"graph","created_at":"2026-05-18T01:14:20Z","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":"Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in an ensemble of random geometric graphs. Here we identify structural properties of networks that guarantee that random graphs having these properties are geometric. Specifically we show that random graphs in which expected degree and clustering of every node are fixed to some constants are equivalent to random geometric graphs on the real line, if clustering ","authors_text":"Dmitri Krioukov","cross_cats":["cs.SI","math.PR","math.ST","physics.soc-ph","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-04-06T11:26:18Z","title":"Clustering implies geometry in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01575","kind":"arxiv","version":2},"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:91d6fd232b0faa8623319a78578d63bd1437b4facaea483436764ebce47128f8","target":"record","created_at":"2026-05-18T01:14:20Z","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":"6663758c424beb11cbff0e1a754f70c0e157cb3e97b8a02a02e221070d9be791","cross_cats_sorted":["cs.SI","math.PR","math.ST","physics.soc-ph","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-04-06T11:26:18Z","title_canon_sha256":"76387047e1971b4d2e5567cc16dcf13dcf01d84a8e967a8bda9fc0a3f5ec94b5"},"schema_version":"1.0","source":{"id":"1604.01575","kind":"arxiv","version":2}},"canonical_sha256":"50a2043caea1b3298733d749aa04ad26bc1fd0095b4871e6ec32c1e5ed62baa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50a2043caea1b3298733d749aa04ad26bc1fd0095b4871e6ec32c1e5ed62baa8","first_computed_at":"2026-05-18T01:14:20.365753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:20.365753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkHz+Zyo/Zp88fajMKdk1Oz05sEEKMv9NTOn7vr2GZCl0/X8ZpQ4Nuu/inbansrJjJDvWB0yNiEJbLrtP83wBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:20.366553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01575","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91d6fd232b0faa8623319a78578d63bd1437b4facaea483436764ebce47128f8","sha256:53fe85842de7c3c4f9c614d5c5bb78448889d9cc3ec6ff4e6b6af561625b3942"],"state_sha256":"3100d50669fa14ce0eadaba3a59148e52f75c510d67e29119e4d70955a541f13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gcFBasDVCSY4nxSWjJS++31oyazjPdguoQlBh0JoXhwqz3akwqjyIWmSccH2EHXQWvOhrZg9azz60VmWj7mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:00:50.863635Z","bundle_sha256":"c857a4d695df82eb78bff8d9f846b738d174c6992935b25215b0200cab6024b8"}}