{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AIOI4LCJGOHBVVLQT36DXZ2P2V","short_pith_number":"pith:AIOI4LCJ","schema_version":"1.0","canonical_sha256":"021c8e2c49338e1ad5709efc3be74fd55e83a185a5d84f8a3140a500b82f0472","source":{"kind":"arxiv","id":"1202.5945","version":4},"attestation_state":"computed","paper":{"title":"A Note on Interference in Random Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Luc Devroye, Pat Morin","submitted_at":"2012-02-27T14:19:59Z","abstract_excerpt":"The (maximum receiver-centric) interference of a geometric graph (von Rickenbach etal (2005)) is studied. It is shown that, with high probability, the following results hold for a set, V, of n points independently and uniformly distributed in the unit d-cube, for constant dimension d: (1) there exists a connected graph with vertex set V that has interference O((log n)^{1/3}); (2) no connected graph with vertex set V has interference o((log n)^{1/4}); and (3) the minimum spanning tree of $V$ has interference Theta((\\log n)^{1/2})."},"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":"1202.5945","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-27T14:19:59Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8b400ebba0b095d394c320e44900f24fc44e510b1c5816d1381b33878dab9cab","abstract_canon_sha256":"02723670987a6bc1918cdf3eb4930c8109979a00fd10f60d323ba12b56aaec82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.850141Z","signature_b64":"Om65Xnd5OoZWtoWFW8kJGNUizKAJUfnhB1Ubaes5Blz3TATc9pluKOuAiGoav/1Qsak7GXn6C1LKVwAdvHSsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021c8e2c49338e1ad5709efc3be74fd55e83a185a5d84f8a3140a500b82f0472","last_reissued_at":"2026-05-18T03:53:44.849545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.849545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Interference in Random Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Luc Devroye, Pat Morin","submitted_at":"2012-02-27T14:19:59Z","abstract_excerpt":"The (maximum receiver-centric) interference of a geometric graph (von Rickenbach etal (2005)) is studied. It is shown that, with high probability, the following results hold for a set, V, of n points independently and uniformly distributed in the unit d-cube, for constant dimension d: (1) there exists a connected graph with vertex set V that has interference O((log n)^{1/3}); (2) no connected graph with vertex set V has interference o((log n)^{1/4}); and (3) the minimum spanning tree of $V$ has interference Theta((\\log n)^{1/2})."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5945","kind":"arxiv","version":4},"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":"1202.5945","created_at":"2026-05-18T03:53:44.849651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5945v4","created_at":"2026-05-18T03:53:44.849651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5945","created_at":"2026-05-18T03:53:44.849651+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIOI4LCJGOHB","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIOI4LCJGOHBVVLQ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIOI4LCJ","created_at":"2026-05-18T12:26:58.693483+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/AIOI4LCJGOHBVVLQT36DXZ2P2V","json":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V.json","graph_json":"https://pith.science/api/pith-number/AIOI4LCJGOHBVVLQT36DXZ2P2V/graph.json","events_json":"https://pith.science/api/pith-number/AIOI4LCJGOHBVVLQT36DXZ2P2V/events.json","paper":"https://pith.science/paper/AIOI4LCJ"},"agent_actions":{"view_html":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V","download_json":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V.json","view_paper":"https://pith.science/paper/AIOI4LCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5945&json=true","fetch_graph":"https://pith.science/api/pith-number/AIOI4LCJGOHBVVLQT36DXZ2P2V/graph.json","fetch_events":"https://pith.science/api/pith-number/AIOI4LCJGOHBVVLQT36DXZ2P2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V/action/storage_attestation","attest_author":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V/action/author_attestation","sign_citation":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V/action/citation_signature","submit_replication":"https://pith.science/pith/AIOI4LCJGOHBVVLQT36DXZ2P2V/action/replication_record"}},"created_at":"2026-05-18T03:53:44.849651+00:00","updated_at":"2026-05-18T03:53:44.849651+00:00"}