{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:CBOZUBXIK4NJY4HER6ZEJM2WNJ","short_pith_number":"pith:CBOZUBXI","schema_version":"1.0","canonical_sha256":"105d9a06e8571a9c70e48fb244b3566a583c31140dd3115a53f1d94695e89aff","source":{"kind":"arxiv","id":"0811.1766","version":1},"attestation_state":"computed","paper":{"title":"Combinatorics of Tripartite Boundary Connections for Trees and Dimers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"David B. Wilson, Richard W. Kenyon","submitted_at":"2008-11-11T20:41:30Z","abstract_excerpt":"A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for \"tripartite\" pairings of the nodes, the probability can be computed as a Pfaffian in the entries of the Dirichlet-to-Neumann matrix (discrete Hilbert transform) of the graph. These formulas generalize the determinant formulas given by Curtis, Ingerman, and Morrow, and by Fomin, for parallel pa"},"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":"0811.1766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-11T20:41:30Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ea16545d23b6f4b21527ecee429e621a3ec856068a5738ac3a89781666226fdc","abstract_canon_sha256":"0add9d2418a7cc2a6da11f7ad4d4100e51a1704bff2fe726ef5a6fa18453381b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:32.724827Z","signature_b64":"0z1QZ4airQnhIjMzYEWGSs4RrnusZEts7VXYeLdXsZxXSRBqgRZwEf1IgUYtsFfsrZzaONUl7cGDuByM60/2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"105d9a06e8571a9c70e48fb244b3566a583c31140dd3115a53f1d94695e89aff","last_reissued_at":"2026-05-18T04:19:32.724373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:32.724373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorics of Tripartite Boundary Connections for Trees and Dimers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"David B. Wilson, Richard W. Kenyon","submitted_at":"2008-11-11T20:41:30Z","abstract_excerpt":"A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for \"tripartite\" pairings of the nodes, the probability can be computed as a Pfaffian in the entries of the Dirichlet-to-Neumann matrix (discrete Hilbert transform) of the graph. These formulas generalize the determinant formulas given by Curtis, Ingerman, and Morrow, and by Fomin, for parallel pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1766","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":"0811.1766","created_at":"2026-05-18T04:19:32.724438+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.1766v1","created_at":"2026-05-18T04:19:32.724438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1766","created_at":"2026-05-18T04:19:32.724438+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBOZUBXIK4NJ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBOZUBXIK4NJY4HE","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBOZUBXI","created_at":"2026-05-18T12:25:57.157939+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/CBOZUBXIK4NJY4HER6ZEJM2WNJ","json":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ.json","graph_json":"https://pith.science/api/pith-number/CBOZUBXIK4NJY4HER6ZEJM2WNJ/graph.json","events_json":"https://pith.science/api/pith-number/CBOZUBXIK4NJY4HER6ZEJM2WNJ/events.json","paper":"https://pith.science/paper/CBOZUBXI"},"agent_actions":{"view_html":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ","download_json":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ.json","view_paper":"https://pith.science/paper/CBOZUBXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.1766&json=true","fetch_graph":"https://pith.science/api/pith-number/CBOZUBXIK4NJY4HER6ZEJM2WNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CBOZUBXIK4NJY4HER6ZEJM2WNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/action/storage_attestation","attest_author":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/action/author_attestation","sign_citation":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/action/citation_signature","submit_replication":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/action/replication_record"}},"created_at":"2026-05-18T04:19:32.724438+00:00","updated_at":"2026-05-18T04:19:32.724438+00:00"}