{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2K2YMXTCQEGJSY7SXYSNVT56ME","short_pith_number":"pith:2K2YMXTC","canonical_record":{"source":{"id":"1211.5928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-26T12:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"e12c43985b2e3e0479241e697917aa70d782f9c156a2a21a80fc9f0f69e346df","abstract_canon_sha256":"6a2fc2b27e43c768b46cd7ed0762afda800ccec8a4ffa38b52318c991aa74d9b"},"schema_version":"1.0"},"canonical_sha256":"d2b5865e62810c9963f2be24dacfbe610d1fbf4e71de51a24b4f431dcf4fbdb0","source":{"kind":"arxiv","id":"1211.5928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5928","created_at":"2026-05-18T01:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5928v1","created_at":"2026-05-18T01:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5928","created_at":"2026-05-18T01:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"2K2YMXTCQEGJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2K2YMXTCQEGJSY7S","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2K2YMXTC","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2K2YMXTCQEGJSY7SXYSNVT56ME","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-26T12:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"e12c43985b2e3e0479241e697917aa70d782f9c156a2a21a80fc9f0f69e346df","abstract_canon_sha256":"6a2fc2b27e43c768b46cd7ed0762afda800ccec8a4ffa38b52318c991aa74d9b"},"schema_version":"1.0"},"canonical_sha256":"d2b5865e62810c9963f2be24dacfbe610d1fbf4e71de51a24b4f431dcf4fbdb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:52:55.129083Z","signature_b64":"uJGcIPLaj0olFp0tdXWpkGDkCQgbZXL6w6ue/ge2miC2CLArxgdufSQT9j29zE6Y7SySCSet8Nd9y6+Elqo6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2b5865e62810c9963f2be24dacfbe610d1fbf4e71de51a24b4f431dcf4fbdb0","last_reissued_at":"2026-05-18T01:52:55.128568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:52:55.128568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5928","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-18T01:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWCxK2aMFxUyzg5hGh3IFvhtrjaYniGM2yzlh5IzjNOX1l+IA3heVs8xwgx2f1up3DFiKZDRnE/fzOzSegExBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:40:15.499617Z"},"content_sha256":"741611320068026188d0a493e933d9328b674cafc23f56078c9fb8c4e378e011","schema_version":"1.0","event_id":"sha256:741611320068026188d0a493e933d9328b674cafc23f56078c9fb8c4e378e011"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2K2YMXTCQEGJSY7SXYSNVT56ME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting Matrix and Domino Tiling with Diagonal Impurities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fumihiko Nakano, Taizo Sadahiro","submitted_at":"2012-11-26T12:16:08Z","abstract_excerpt":"As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the hitting matrix method[4]. (2) we have an alternative proof of the main result in [9] and result in (1) above using the formula by Kenyon-Wilson [6, 7] of counting the number of groves on the circular planar graph. (3) we study the behavior of the probability of finding the impurity at a given site when the size of the graph tends to infinity, as well as the scalin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5928","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-18T01:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSiq6/wQeMwHl7AbtHtsIvdRCl0EpaY3FrMZANC+T5WCEfmh7SIK2/tTpKr9sLXmOyFDNsbmFOsvpdrMImGOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:40:15.500300Z"},"content_sha256":"b01759cd25a19fbc4967b7068f2e655abf524df0fa4a6bd6b0d7fec52c8e2b1f","schema_version":"1.0","event_id":"sha256:b01759cd25a19fbc4967b7068f2e655abf524df0fa4a6bd6b0d7fec52c8e2b1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2K2YMXTCQEGJSY7SXYSNVT56ME/bundle.json","state_url":"https://pith.science/pith/2K2YMXTCQEGJSY7SXYSNVT56ME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2K2YMXTCQEGJSY7SXYSNVT56ME/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-06-11T03:40:15Z","links":{"resolver":"https://pith.science/pith/2K2YMXTCQEGJSY7SXYSNVT56ME","bundle":"https://pith.science/pith/2K2YMXTCQEGJSY7SXYSNVT56ME/bundle.json","state":"https://pith.science/pith/2K2YMXTCQEGJSY7SXYSNVT56ME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2K2YMXTCQEGJSY7SXYSNVT56ME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2K2YMXTCQEGJSY7SXYSNVT56ME","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":"6a2fc2b27e43c768b46cd7ed0762afda800ccec8a4ffa38b52318c991aa74d9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-26T12:16:08Z","title_canon_sha256":"e12c43985b2e3e0479241e697917aa70d782f9c156a2a21a80fc9f0f69e346df"},"schema_version":"1.0","source":{"id":"1211.5928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5928","created_at":"2026-05-18T01:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5928v1","created_at":"2026-05-18T01:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5928","created_at":"2026-05-18T01:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"2K2YMXTCQEGJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2K2YMXTCQEGJSY7S","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2K2YMXTC","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:b01759cd25a19fbc4967b7068f2e655abf524df0fa4a6bd6b0d7fec52c8e2b1f","target":"graph","created_at":"2026-05-18T01:52:55Z","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":"As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the hitting matrix method[4]. (2) we have an alternative proof of the main result in [9] and result in (1) above using the formula by Kenyon-Wilson [6, 7] of counting the number of groves on the circular planar graph. (3) we study the behavior of the probability of finding the impurity at a given site when the size of the graph tends to infinity, as well as the scalin","authors_text":"Fumihiko Nakano, Taizo Sadahiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-26T12:16:08Z","title":"Hitting Matrix and Domino Tiling with Diagonal Impurities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5928","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:741611320068026188d0a493e933d9328b674cafc23f56078c9fb8c4e378e011","target":"record","created_at":"2026-05-18T01:52:55Z","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":"6a2fc2b27e43c768b46cd7ed0762afda800ccec8a4ffa38b52318c991aa74d9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-26T12:16:08Z","title_canon_sha256":"e12c43985b2e3e0479241e697917aa70d782f9c156a2a21a80fc9f0f69e346df"},"schema_version":"1.0","source":{"id":"1211.5928","kind":"arxiv","version":1}},"canonical_sha256":"d2b5865e62810c9963f2be24dacfbe610d1fbf4e71de51a24b4f431dcf4fbdb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2b5865e62810c9963f2be24dacfbe610d1fbf4e71de51a24b4f431dcf4fbdb0","first_computed_at":"2026-05-18T01:52:55.128568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:52:55.128568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJGcIPLaj0olFp0tdXWpkGDkCQgbZXL6w6ue/ge2miC2CLArxgdufSQT9j29zE6Y7SySCSet8Nd9y6+Elqo6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:52:55.129083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:741611320068026188d0a493e933d9328b674cafc23f56078c9fb8c4e378e011","sha256:b01759cd25a19fbc4967b7068f2e655abf524df0fa4a6bd6b0d7fec52c8e2b1f"],"state_sha256":"ae5e1bbec527d43a6dd9cf61f3f7f3c185077d001d4bd524b54595792899d9d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tB216pyG/Nr6nU6/Yn8gURHyT4X3fQMpVEYdPCmuTKmhybugwBGn/nPISo0OOpQd2BFGlDGUhJXcs5TCFBQWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:40:15.504160Z","bundle_sha256":"cf577407919f4d40335a4dd9e5420518726c635364a363d48fd37fb6beb53de7"}}