{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WSKOPDXOKEY3C4L2SEDKPZ5UUM","short_pith_number":"pith:WSKOPDXO","schema_version":"1.0","canonical_sha256":"b494e78eee5131b1717a9106a7e7b4a332fec22ce769efa4ac4503aff8d55f24","source":{"kind":"arxiv","id":"2501.14830","version":1},"attestation_state":"computed","paper":{"title":"Sharp exact recovery threshold for two-community Euclidean random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.SI","authors_text":"Charlie K. Guan, Julia Gaudio","submitted_at":"2025-01-22T22:26:07Z","abstract_excerpt":"This paper considers the problem of label recovery in random graphs and matrices. Motivated by transitive behavior in real-world networks (i.e., ``the friend of my friend is my friend''), a recent line of work considers spatially-embedded networks, which exhibit transitive behavior. In particular, the Geometric Hidden Community Model (GHCM), introduced by Gaudio, Guan, Niu, and Wei, models a network as a labeled Poisson point process where every pair of vertices is associated with a pairwise observation whose distribution depends on the labels and positions of the vertices. The GHCM is in turn"},"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":"2501.14830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-01-22T22:26:07Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"069a48535f482706c432753149d3220e2f005f61104913e6e1667f4db7e86846","abstract_canon_sha256":"e7b67f4033b66963a8661d582fb580ecd2213646b57c13908fd5ab7b3e2ba32d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:19.574218Z","signature_b64":"3In0/t+gGbJJ2xH4+efqcyVHVCENBn3tNGSIYB81xp0xXCjk3Q0XAqbYG2E21MxPG64t9w1/IRZ6MXwuLhDCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b494e78eee5131b1717a9106a7e7b4a332fec22ce769efa4ac4503aff8d55f24","last_reissued_at":"2026-07-05T10:05:19.573651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:19.573651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp exact recovery threshold for two-community Euclidean random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.SI","authors_text":"Charlie K. Guan, Julia Gaudio","submitted_at":"2025-01-22T22:26:07Z","abstract_excerpt":"This paper considers the problem of label recovery in random graphs and matrices. Motivated by transitive behavior in real-world networks (i.e., ``the friend of my friend is my friend''), a recent line of work considers spatially-embedded networks, which exhibit transitive behavior. In particular, the Geometric Hidden Community Model (GHCM), introduced by Gaudio, Guan, Niu, and Wei, models a network as a labeled Poisson point process where every pair of vertices is associated with a pairwise observation whose distribution depends on the labels and positions of the vertices. The GHCM is in turn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14830","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.14830/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.14830","created_at":"2026-07-05T10:05:19.573712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14830v1","created_at":"2026-07-05T10:05:19.573712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14830","created_at":"2026-07-05T10:05:19.573712+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSKOPDXOKEY3","created_at":"2026-07-05T10:05:19.573712+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSKOPDXOKEY3C4L2","created_at":"2026-07-05T10:05:19.573712+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSKOPDXO","created_at":"2026-07-05T10:05:19.573712+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02851","citing_title":"Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM","json":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM.json","graph_json":"https://pith.science/api/pith-number/WSKOPDXOKEY3C4L2SEDKPZ5UUM/graph.json","events_json":"https://pith.science/api/pith-number/WSKOPDXOKEY3C4L2SEDKPZ5UUM/events.json","paper":"https://pith.science/paper/WSKOPDXO"},"agent_actions":{"view_html":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM","download_json":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM.json","view_paper":"https://pith.science/paper/WSKOPDXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14830&json=true","fetch_graph":"https://pith.science/api/pith-number/WSKOPDXOKEY3C4L2SEDKPZ5UUM/graph.json","fetch_events":"https://pith.science/api/pith-number/WSKOPDXOKEY3C4L2SEDKPZ5UUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM/action/storage_attestation","attest_author":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM/action/author_attestation","sign_citation":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM/action/citation_signature","submit_replication":"https://pith.science/pith/WSKOPDXOKEY3C4L2SEDKPZ5UUM/action/replication_record"}},"created_at":"2026-07-05T10:05:19.573712+00:00","updated_at":"2026-07-05T10:05:19.573712+00:00"}