{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7T25Z5UNPRHYOFLOOZ4BQMVBTI","short_pith_number":"pith:7T25Z5UN","schema_version":"1.0","canonical_sha256":"fcf5dcf68d7c4f87156e76781832a19a0948e956c3f02998674ca039d32e1786","source":{"kind":"arxiv","id":"1109.4311","version":1},"attestation_state":"computed","paper":{"title":"On the Mixing Time of Geographical Threshold Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Andrew Beveridge, Milan Bradonji\\'c","submitted_at":"2011-09-20T14:51:30Z","abstract_excerpt":"We study the mixing time of random graphs in the $d$-dimensional toric unit cube $[0,1]^d$ generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights, drawn from some distribution. The connectivity threshold for GTGs is comparable to that of RGGs, essentially corresponding to a connectivity radius of $r=(\\log n/n)^{1/d}$. However, the degree distributions at "},"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":"1109.4311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-20T14:51:30Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b0114e6edbaabd9a51d2dc30306d2cb80599ae18d814f996d8c5b87036ef5448","abstract_canon_sha256":"e3239b0a2b1f70eeab86b6a584c21d29c7bf5749ea729a556f7a1f268bc93392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:43.588131Z","signature_b64":"CJbRhRIws7qinoGBmAhG7aMxabDldvcZjtQbfRYJ1FUg4IX//aoEFXTN5++wmKI3xvJM4XAkYeKh/UK68DlcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcf5dcf68d7c4f87156e76781832a19a0948e956c3f02998674ca039d32e1786","last_reissued_at":"2026-05-18T04:12:43.587441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:43.587441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Mixing Time of Geographical Threshold Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Andrew Beveridge, Milan Bradonji\\'c","submitted_at":"2011-09-20T14:51:30Z","abstract_excerpt":"We study the mixing time of random graphs in the $d$-dimensional toric unit cube $[0,1]^d$ generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights, drawn from some distribution. The connectivity threshold for GTGs is comparable to that of RGGs, essentially corresponding to a connectivity radius of $r=(\\log n/n)^{1/d}$. However, the degree distributions at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4311","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":"1109.4311","created_at":"2026-05-18T04:12:43.587537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4311v1","created_at":"2026-05-18T04:12:43.587537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4311","created_at":"2026-05-18T04:12:43.587537+00:00"},{"alias_kind":"pith_short_12","alias_value":"7T25Z5UNPRHY","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7T25Z5UNPRHYOFLO","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7T25Z5UN","created_at":"2026-05-18T12:26:22.705136+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/7T25Z5UNPRHYOFLOOZ4BQMVBTI","json":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI.json","graph_json":"https://pith.science/api/pith-number/7T25Z5UNPRHYOFLOOZ4BQMVBTI/graph.json","events_json":"https://pith.science/api/pith-number/7T25Z5UNPRHYOFLOOZ4BQMVBTI/events.json","paper":"https://pith.science/paper/7T25Z5UN"},"agent_actions":{"view_html":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI","download_json":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI.json","view_paper":"https://pith.science/paper/7T25Z5UN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4311&json=true","fetch_graph":"https://pith.science/api/pith-number/7T25Z5UNPRHYOFLOOZ4BQMVBTI/graph.json","fetch_events":"https://pith.science/api/pith-number/7T25Z5UNPRHYOFLOOZ4BQMVBTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI/action/storage_attestation","attest_author":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI/action/author_attestation","sign_citation":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI/action/citation_signature","submit_replication":"https://pith.science/pith/7T25Z5UNPRHYOFLOOZ4BQMVBTI/action/replication_record"}},"created_at":"2026-05-18T04:12:43.587537+00:00","updated_at":"2026-05-18T04:12:43.587537+00:00"}