{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V67VSKK7U6HLHFBHILQ7TGDIR7","short_pith_number":"pith:V67VSKK7","schema_version":"1.0","canonical_sha256":"afbf59295fa78eb3942742e1f998688fff383088b3b30d5bfa41050986f2eb4e","source":{"kind":"arxiv","id":"2410.16836","version":4},"attestation_state":"computed","paper":{"title":"Local limits of random spanning trees in random environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Luca Makowiec","submitted_at":"2024-10-22T09:15:01Z","abstract_excerpt":"We study the edge overlap and local limit of the random spanning tree in random environment (RSTRE) on the complete graph with $n$ vertices and weights given by $\\exp(-\\beta \\omega_e)$ for $\\omega_e$ uniformly distributed on $[0,1]$. We show that for $\\beta$ growing with $\\beta = o(n/\\log n)$, the edge overlap is $(1+o(1)) \\beta$, while for $\\beta$ much larger than $n \\log^2 n$, the edge overlap is $(1-o(1))n$. Furthermore, there is a transition of the local limit around $\\beta = n$. When $\\beta = o(n/ \\log n)$ the RSTRE locally converges to the same limit as the uniform spanning tree, whereas"},"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":"2410.16836","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-22T09:15:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5ae7c085cb58d9a019ad1e78f254e26ea78f5e2caa5f0eef7afd99b29c7f80f6","abstract_canon_sha256":"b81507746d0bd69463f9b4f35f06185a2fca2919036f0c050249c192e73a741f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:47.220291Z","signature_b64":"3alibz5JUPNvNTvhQcHrg9Wnw0aNQxrWtgiObnbJ9RQxYvlICKUo+FS4Hoq351cf5pPe/qeUN/8nbTndzTAKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afbf59295fa78eb3942742e1f998688fff383088b3b30d5bfa41050986f2eb4e","last_reissued_at":"2026-05-20T00:02:47.219524Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:47.219524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local limits of random spanning trees in random environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Luca Makowiec","submitted_at":"2024-10-22T09:15:01Z","abstract_excerpt":"We study the edge overlap and local limit of the random spanning tree in random environment (RSTRE) on the complete graph with $n$ vertices and weights given by $\\exp(-\\beta \\omega_e)$ for $\\omega_e$ uniformly distributed on $[0,1]$. We show that for $\\beta$ growing with $\\beta = o(n/\\log n)$, the edge overlap is $(1+o(1)) \\beta$, while for $\\beta$ much larger than $n \\log^2 n$, the edge overlap is $(1-o(1))n$. Furthermore, there is a transition of the local limit around $\\beta = n$. When $\\beta = o(n/ \\log n)$ the RSTRE locally converges to the same limit as the uniform spanning tree, whereas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16836","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.16836/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":"2410.16836","created_at":"2026-05-20T00:02:47.219647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16836v4","created_at":"2026-05-20T00:02:47.219647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16836","created_at":"2026-05-20T00:02:47.219647+00:00"},{"alias_kind":"pith_short_12","alias_value":"V67VSKK7U6HL","created_at":"2026-05-20T00:02:47.219647+00:00"},{"alias_kind":"pith_short_16","alias_value":"V67VSKK7U6HLHFBH","created_at":"2026-05-20T00:02:47.219647+00:00"},{"alias_kind":"pith_short_8","alias_value":"V67VSKK7","created_at":"2026-05-20T00:02:47.219647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2410.16830","citing_title":"Random spanning trees in random environment","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7","json":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7.json","graph_json":"https://pith.science/api/pith-number/V67VSKK7U6HLHFBHILQ7TGDIR7/graph.json","events_json":"https://pith.science/api/pith-number/V67VSKK7U6HLHFBHILQ7TGDIR7/events.json","paper":"https://pith.science/paper/V67VSKK7"},"agent_actions":{"view_html":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7","download_json":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7.json","view_paper":"https://pith.science/paper/V67VSKK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16836&json=true","fetch_graph":"https://pith.science/api/pith-number/V67VSKK7U6HLHFBHILQ7TGDIR7/graph.json","fetch_events":"https://pith.science/api/pith-number/V67VSKK7U6HLHFBHILQ7TGDIR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7/action/storage_attestation","attest_author":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7/action/author_attestation","sign_citation":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7/action/citation_signature","submit_replication":"https://pith.science/pith/V67VSKK7U6HLHFBHILQ7TGDIR7/action/replication_record"}},"created_at":"2026-05-20T00:02:47.219647+00:00","updated_at":"2026-05-20T00:02:47.219647+00:00"}