{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:XUXMIS4BPBNOALWXL2CPVNGBCZ","short_pith_number":"pith:XUXMIS4B","schema_version":"1.0","canonical_sha256":"bd2ec44b81785ae02ed75e84fab4c1164900ba94a8011621511ad6592aab8b7b","source":{"kind":"arxiv","id":"math/0606750","version":1},"attestation_state":"computed","paper":{"title":"Ends in free minimal spanning forests","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Ad\\'am Tim\\'ar","submitted_at":"2006-06-29T10:32:07Z","abstract_excerpt":"We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm."},"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":"math/0606750","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-06-29T10:32:07Z","cross_cats_sorted":[],"title_canon_sha256":"5d246d413dea6133d1f1477c15c37f7f7b8d76cc04299782062b1911fdb93522","abstract_canon_sha256":"ec555e47ccf923dc403f23b313b8e83ceec77fa3f8fcf575589fe28e392d7db0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:50.175752Z","signature_b64":"j/SmZK/arkCnW8uagTHW+5aqfOZ3BAcWT7rjVCxB66YaCokAfTM8IUE8dLTTzYRASX4sg28Tgr1/p6hsISA2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd2ec44b81785ae02ed75e84fab4c1164900ba94a8011621511ad6592aab8b7b","last_reissued_at":"2026-05-18T01:08:50.175052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:50.175052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ends in free minimal spanning forests","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Ad\\'am Tim\\'ar","submitted_at":"2006-06-29T10:32:07Z","abstract_excerpt":"We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606750","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":"math/0606750","created_at":"2026-05-18T01:08:50.175158+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0606750v1","created_at":"2026-05-18T01:08:50.175158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606750","created_at":"2026-05-18T01:08:50.175158+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUXMIS4BPBNO","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUXMIS4BPBNOALWX","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUXMIS4B","created_at":"2026-05-18T12:25:54.717736+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/XUXMIS4BPBNOALWXL2CPVNGBCZ","json":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ.json","graph_json":"https://pith.science/api/pith-number/XUXMIS4BPBNOALWXL2CPVNGBCZ/graph.json","events_json":"https://pith.science/api/pith-number/XUXMIS4BPBNOALWXL2CPVNGBCZ/events.json","paper":"https://pith.science/paper/XUXMIS4B"},"agent_actions":{"view_html":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ","download_json":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ.json","view_paper":"https://pith.science/paper/XUXMIS4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0606750&json=true","fetch_graph":"https://pith.science/api/pith-number/XUXMIS4BPBNOALWXL2CPVNGBCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XUXMIS4BPBNOALWXL2CPVNGBCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ/action/storage_attestation","attest_author":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ/action/author_attestation","sign_citation":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ/action/citation_signature","submit_replication":"https://pith.science/pith/XUXMIS4BPBNOALWXL2CPVNGBCZ/action/replication_record"}},"created_at":"2026-05-18T01:08:50.175158+00:00","updated_at":"2026-05-18T01:08:50.175158+00:00"}