{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ESEVLI3ZAJCS4NEX44RRK4XDEK","short_pith_number":"pith:ESEVLI3Z","schema_version":"1.0","canonical_sha256":"248955a37902452e3497e7231572e322bb7efdbcd1e9478bcbf0133f3bd1ef8f","source":{"kind":"arxiv","id":"1602.05712","version":3},"attestation_state":"computed","paper":{"title":"Average Distance in a General Class of Scale-Free Networks with Underlying Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Johannes Lengler, Karl Bringmann, Ralph Keusch","submitted_at":"2016-02-18T08:26:01Z","abstract_excerpt":"In Chung-Lu random graphs, a classic model for real-world networks, each vertex is equipped with a weight drawn from a power-law distribution, and two vertices form an edge independently with probability proportional to the product of their weights. Chung-Lu graphs have average distance O(log log n) and thus reproduce the small-world phenomenon, a key property of real-world networks. Modern, more realistic variants of this model also equip each vertex with a random position in a specific underlying geometry. The edge probability of two vertices then depends, say, inversely polynomial on their "},"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":"1602.05712","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-18T08:26:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"317cebd60d8ae73d0f7ce26a72f1807a33d30972c8c764c0456013e3ddb15931","abstract_canon_sha256":"6ad37c7f2ff2aaceb456a193bb43a2172e498c42ef35385895968cb30f3ac85e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.407093Z","signature_b64":"/YbtrvwTacF/nzZyuNs37O3gGd+4DJkdQSBoccLgspT/NZ+HthIZ62Iq2YLoXLpq7JziOdKbm025YhKcTbp+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"248955a37902452e3497e7231572e322bb7efdbcd1e9478bcbf0133f3bd1ef8f","last_reissued_at":"2026-05-18T00:01:39.406663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.406663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Distance in a General Class of Scale-Free Networks with Underlying Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Johannes Lengler, Karl Bringmann, Ralph Keusch","submitted_at":"2016-02-18T08:26:01Z","abstract_excerpt":"In Chung-Lu random graphs, a classic model for real-world networks, each vertex is equipped with a weight drawn from a power-law distribution, and two vertices form an edge independently with probability proportional to the product of their weights. Chung-Lu graphs have average distance O(log log n) and thus reproduce the small-world phenomenon, a key property of real-world networks. Modern, more realistic variants of this model also equip each vertex with a random position in a specific underlying geometry. The edge probability of two vertices then depends, say, inversely polynomial on their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05712","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.05712","created_at":"2026-05-18T00:01:39.406730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05712v3","created_at":"2026-05-18T00:01:39.406730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05712","created_at":"2026-05-18T00:01:39.406730+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESEVLI3ZAJCS","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESEVLI3ZAJCS4NEX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESEVLI3Z","created_at":"2026-05-18T12:30:15.759754+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/ESEVLI3ZAJCS4NEX44RRK4XDEK","json":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK.json","graph_json":"https://pith.science/api/pith-number/ESEVLI3ZAJCS4NEX44RRK4XDEK/graph.json","events_json":"https://pith.science/api/pith-number/ESEVLI3ZAJCS4NEX44RRK4XDEK/events.json","paper":"https://pith.science/paper/ESEVLI3Z"},"agent_actions":{"view_html":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK","download_json":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK.json","view_paper":"https://pith.science/paper/ESEVLI3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05712&json=true","fetch_graph":"https://pith.science/api/pith-number/ESEVLI3ZAJCS4NEX44RRK4XDEK/graph.json","fetch_events":"https://pith.science/api/pith-number/ESEVLI3ZAJCS4NEX44RRK4XDEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK/action/storage_attestation","attest_author":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK/action/author_attestation","sign_citation":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK/action/citation_signature","submit_replication":"https://pith.science/pith/ESEVLI3ZAJCS4NEX44RRK4XDEK/action/replication_record"}},"created_at":"2026-05-18T00:01:39.406730+00:00","updated_at":"2026-05-18T00:01:39.406730+00:00"}