{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:X6X5SWSQQHSI7LWHUXOV5QSSUV","short_pith_number":"pith:X6X5SWSQ","schema_version":"1.0","canonical_sha256":"bfafd95a5081e48faec7a5dd5ec252a5605f9cd7b8718fef8ddc3c24d1b08585","source":{"kind":"arxiv","id":"math/0608422","version":4},"attestation_state":"computed","paper":{"title":"Boundary Partitions in Trees and Dimers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math.CO"],"primary_cat":"math.PR","authors_text":"David B. Wilson, Richard W. Kenyon","submitted_at":"2006-08-16T09:04:13Z","abstract_excerpt":"Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of the different possible node connections in a grove. These probabilities only depend on boundary measurements of the graph and not on the actual graph structure, i.e., the probabilities can be expressed as functions of the pairwise electrical resistances between the nodes, or equivalently, as functions of the Dirichlet-to-Neumann operator (or response matrix"},"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/0608422","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-08-16T09:04:13Z","cross_cats_sorted":["hep-th","math.CO"],"title_canon_sha256":"eed0e2b6aeb95a286c0ab6b472ad11ab5decef8b278c825d81257384f5de2e31","abstract_canon_sha256":"835a93913243fbc382e794a9331d0b4e0e465bdfe171fe7246d03325ba5fddd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:04.627138Z","signature_b64":"6BY375SABZhAYifAjt2lfkIU7DWnbbQiOXbCOrnVjRN5vTfAq9+Yh+12+aIsX/QFVlXT+p3mMV/tk024IVz4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfafd95a5081e48faec7a5dd5ec252a5605f9cd7b8718fef8ddc3c24d1b08585","last_reissued_at":"2026-05-18T04:19:04.626551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:04.626551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boundary Partitions in Trees and Dimers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math.CO"],"primary_cat":"math.PR","authors_text":"David B. Wilson, Richard W. Kenyon","submitted_at":"2006-08-16T09:04:13Z","abstract_excerpt":"Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of the different possible node connections in a grove. These probabilities only depend on boundary measurements of the graph and not on the actual graph structure, i.e., the probabilities can be expressed as functions of the pairwise electrical resistances between the nodes, or equivalently, as functions of the Dirichlet-to-Neumann operator (or response matrix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0608422","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":"math/0608422","created_at":"2026-05-18T04:19:04.626641+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0608422v4","created_at":"2026-05-18T04:19:04.626641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0608422","created_at":"2026-05-18T04:19:04.626641+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6X5SWSQQHSI","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6X5SWSQQHSI7LWH","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6X5SWSQ","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.04701","citing_title":"Three-point functions in critical loop models","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV","json":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV.json","graph_json":"https://pith.science/api/pith-number/X6X5SWSQQHSI7LWHUXOV5QSSUV/graph.json","events_json":"https://pith.science/api/pith-number/X6X5SWSQQHSI7LWHUXOV5QSSUV/events.json","paper":"https://pith.science/paper/X6X5SWSQ"},"agent_actions":{"view_html":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV","download_json":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV.json","view_paper":"https://pith.science/paper/X6X5SWSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0608422&json=true","fetch_graph":"https://pith.science/api/pith-number/X6X5SWSQQHSI7LWHUXOV5QSSUV/graph.json","fetch_events":"https://pith.science/api/pith-number/X6X5SWSQQHSI7LWHUXOV5QSSUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV/action/storage_attestation","attest_author":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV/action/author_attestation","sign_citation":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV/action/citation_signature","submit_replication":"https://pith.science/pith/X6X5SWSQQHSI7LWHUXOV5QSSUV/action/replication_record"}},"created_at":"2026-05-18T04:19:04.626641+00:00","updated_at":"2026-05-18T04:19:04.626641+00:00"}