{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:CBOZUBXIK4NJY4HER6ZEJM2WNJ","short_pith_number":"pith:CBOZUBXI","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"},"canonical_sha256":"105d9a06e8571a9c70e48fb244b3566a583c31140dd3115a53f1d94695e89aff","source":{"kind":"arxiv","id":"0811.1766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.1766","created_at":"2026-05-18T04:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"0811.1766v1","created_at":"2026-05-18T04:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1766","created_at":"2026-05-18T04:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"CBOZUBXIK4NJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"CBOZUBXIK4NJY4HE","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"CBOZUBXI","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:CBOZUBXIK4NJY4HER6ZEJM2WNJ","target":"record","payload":{"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"},"canonical_sha256":"105d9a06e8571a9c70e48fb244b3566a583c31140dd3115a53f1d94695e89aff","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"},"source_kind":"arxiv","source_id":"0811.1766","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+F3RHunhEGnIHbMnBwWCSnmtSypGKCKEfSxFDjhShX1AEUjePWRP7suXq4kGnb6YVuw31zNc3TnqGvHCce90DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:02:40.989653Z"},"content_sha256":"072966f0870e62969babb0374b689441d674e576ae885b197aeb000012d275cc","schema_version":"1.0","event_id":"sha256:072966f0870e62969babb0374b689441d674e576ae885b197aeb000012d275cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:CBOZUBXIK4NJY4HER6ZEJM2WNJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yf1kc5QXBl1rflZKAV4zWmiMLBDQGjJGmCG82NRIPe7SvdubWVpupPBF7ZEY3CPeRNLcMTqyCPV0QoKR4dZZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:02:40.990285Z"},"content_sha256":"a9e57de6aa06f5e9b4dc7321697b30bb3aab97c41bbbbffcf79154272c070639","schema_version":"1.0","event_id":"sha256:a9e57de6aa06f5e9b4dc7321697b30bb3aab97c41bbbbffcf79154272c070639"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/bundle.json","state_url":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:02:40Z","links":{"resolver":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ","bundle":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/bundle.json","state":"https://pith.science/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBOZUBXIK4NJY4HER6ZEJM2WNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:CBOZUBXIK4NJY4HER6ZEJM2WNJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0add9d2418a7cc2a6da11f7ad4d4100e51a1704bff2fe726ef5a6fa18453381b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-11T20:41:30Z","title_canon_sha256":"ea16545d23b6f4b21527ecee429e621a3ec856068a5738ac3a89781666226fdc"},"schema_version":"1.0","source":{"id":"0811.1766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.1766","created_at":"2026-05-18T04:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"0811.1766v1","created_at":"2026-05-18T04:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1766","created_at":"2026-05-18T04:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"CBOZUBXIK4NJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"CBOZUBXIK4NJY4HE","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"CBOZUBXI","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:a9e57de6aa06f5e9b4dc7321697b30bb3aab97c41bbbbffcf79154272c070639","target":"graph","created_at":"2026-05-18T04:19:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David B. Wilson, Richard W. Kenyon","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-11T20:41:30Z","title":"Combinatorics of Tripartite Boundary Connections for Trees and Dimers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1766","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:072966f0870e62969babb0374b689441d674e576ae885b197aeb000012d275cc","target":"record","created_at":"2026-05-18T04:19:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0add9d2418a7cc2a6da11f7ad4d4100e51a1704bff2fe726ef5a6fa18453381b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-11T20:41:30Z","title_canon_sha256":"ea16545d23b6f4b21527ecee429e621a3ec856068a5738ac3a89781666226fdc"},"schema_version":"1.0","source":{"id":"0811.1766","kind":"arxiv","version":1}},"canonical_sha256":"105d9a06e8571a9c70e48fb244b3566a583c31140dd3115a53f1d94695e89aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"105d9a06e8571a9c70e48fb244b3566a583c31140dd3115a53f1d94695e89aff","first_computed_at":"2026-05-18T04:19:32.724373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:32.724373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0z1QZ4airQnhIjMzYEWGSs4RrnusZEts7VXYeLdXsZxXSRBqgRZwEf1IgUYtsFfsrZzaONUl7cGDuByM60/2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:32.724827Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.1766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:072966f0870e62969babb0374b689441d674e576ae885b197aeb000012d275cc","sha256:a9e57de6aa06f5e9b4dc7321697b30bb3aab97c41bbbbffcf79154272c070639"],"state_sha256":"ef836da15029410a81dc9bae8d4649707d2770e3b5204382cd8d3460ca7e847e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0hlmKiCJ72Z37ic0U+YZ8MKfSYpDUHV7wR5Z0AitkM3+jUalCfZGX3io7K870MGoX2Pnky2eNezYYJ1nKORDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:02:40.993866Z","bundle_sha256":"713b7fc87562d2b7ea73e3ab2d534b3bcbd68e3f2b1560549e1d392e06875158"}}