{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2001:WH2CTULUD5GOAZOXXVCKA4RVH4","short_pith_number":"pith:WH2CTULU","canonical_record":{"source":{"id":"math/0111034","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2001-11-02T20:48:11Z","cross_cats_sorted":[],"title_canon_sha256":"66b72e4a6bb774629f4f52ca77583eaad80131f266107b5c10961a8d4f45bb4f","abstract_canon_sha256":"bed29803ce1ed4414de1baa9b01c06fc46adce591c215c26c7af7eedaf8a3b07"},"schema_version":"1.0"},"canonical_sha256":"b1f429d1741f4ce065d7bd44a072353f34d3097b19090e74ad8d3cb72e5bfefb","source":{"kind":"arxiv","id":"math/0111034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0111034","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"arxiv_version","alias_value":"math/0111034v2","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0111034","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"pith_short_12","alias_value":"WH2CTULUD5GO","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"pith_short_16","alias_value":"WH2CTULUD5GOAZOX","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"pith_short_8","alias_value":"WH2CTULU","created_at":"2026-07-04T14:35:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2001:WH2CTULUD5GOAZOXXVCKA4RVH4","target":"record","payload":{"canonical_record":{"source":{"id":"math/0111034","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2001-11-02T20:48:11Z","cross_cats_sorted":[],"title_canon_sha256":"66b72e4a6bb774629f4f52ca77583eaad80131f266107b5c10961a8d4f45bb4f","abstract_canon_sha256":"bed29803ce1ed4414de1baa9b01c06fc46adce591c215c26c7af7eedaf8a3b07"},"schema_version":"1.0"},"canonical_sha256":"b1f429d1741f4ce065d7bd44a072353f34d3097b19090e74ad8d3cb72e5bfefb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:35:36.415609Z","signature_b64":"NzkPbViVSyh3Rh8uke6FEw2s+ISRmqaJ8KeTFLbXOW7myEPtKHu6jZYAMFqBuZvNbA5XwDjW/l+SDXoSDSS9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f429d1741f4ce065d7bd44a072353f34d3097b19090e74ad8d3cb72e5bfefb","last_reissued_at":"2026-07-04T14:35:36.415207Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:35:36.415207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0111034","source_version":2,"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-07-04T14:35:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3speePDNyYHyOAiL3gm8JRpxiddiKqUPj68mGP1OaiWYmp75lKOjPMk+LR+M40D/kxvspodaglT1qxT9jm6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:55:14.780033Z"},"content_sha256":"e304d93fac2f2f26594145de94ea2b2a2451b3481dac1679289f1f099329b330","schema_version":"1.0","event_id":"sha256:e304d93fac2f2f26594145de94ea2b2a2451b3481dac1679289f1f099329b330"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2001:WH2CTULUD5GOAZOXXVCKA4RVH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized domino-shuffling","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Propp","submitted_at":"2001-11-02T20:48:11Z","abstract_excerpt":"The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights of all the matchings, where the weight of a matching is equal to the product of the (pre-assigned) weights of the constituent edges (assumed to be non-negative). This article presents efficient algorithms that work in this context to solve three problems: finding the sum of the weights of the matchings of a weighted Aztec diamond graph A_n; computing the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0111034","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0111034/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:35:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmB4pUZNkmUjFAbGlBri3tsnYWI+hy0XxcmuZXxdwTKmT4Hsmhh0yI9iEyStoDMdRqEZLzssW0h7tRn9/uj1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:55:14.780546Z"},"content_sha256":"a43d53506d4391796969476fb20035dd8be84c9f2179f4825586d384e7db25ac","schema_version":"1.0","event_id":"sha256:a43d53506d4391796969476fb20035dd8be84c9f2179f4825586d384e7db25ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WH2CTULUD5GOAZOXXVCKA4RVH4/bundle.json","state_url":"https://pith.science/pith/WH2CTULUD5GOAZOXXVCKA4RVH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WH2CTULUD5GOAZOXXVCKA4RVH4/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-08-09T02:55:14Z","links":{"resolver":"https://pith.science/pith/WH2CTULUD5GOAZOXXVCKA4RVH4","bundle":"https://pith.science/pith/WH2CTULUD5GOAZOXXVCKA4RVH4/bundle.json","state":"https://pith.science/pith/WH2CTULUD5GOAZOXXVCKA4RVH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WH2CTULUD5GOAZOXXVCKA4RVH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:WH2CTULUD5GOAZOXXVCKA4RVH4","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":"bed29803ce1ed4414de1baa9b01c06fc46adce591c215c26c7af7eedaf8a3b07","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2001-11-02T20:48:11Z","title_canon_sha256":"66b72e4a6bb774629f4f52ca77583eaad80131f266107b5c10961a8d4f45bb4f"},"schema_version":"1.0","source":{"id":"math/0111034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0111034","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"arxiv_version","alias_value":"math/0111034v2","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0111034","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"pith_short_12","alias_value":"WH2CTULUD5GO","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"pith_short_16","alias_value":"WH2CTULUD5GOAZOX","created_at":"2026-07-04T14:35:36Z"},{"alias_kind":"pith_short_8","alias_value":"WH2CTULU","created_at":"2026-07-04T14:35:36Z"}],"graph_snapshots":[{"event_id":"sha256:a43d53506d4391796969476fb20035dd8be84c9f2179f4825586d384e7db25ac","target":"graph","created_at":"2026-07-04T14:35:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0111034/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights of all the matchings, where the weight of a matching is equal to the product of the (pre-assigned) weights of the constituent edges (assumed to be non-negative). This article presents efficient algorithms that work in this context to solve three problems: finding the sum of the weights of the matchings of a weighted Aztec diamond graph A_n; computing the pro","authors_text":"James Propp","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2001-11-02T20:48:11Z","title":"Generalized domino-shuffling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0111034","kind":"arxiv","version":2},"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:e304d93fac2f2f26594145de94ea2b2a2451b3481dac1679289f1f099329b330","target":"record","created_at":"2026-07-04T14:35:36Z","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":"bed29803ce1ed4414de1baa9b01c06fc46adce591c215c26c7af7eedaf8a3b07","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2001-11-02T20:48:11Z","title_canon_sha256":"66b72e4a6bb774629f4f52ca77583eaad80131f266107b5c10961a8d4f45bb4f"},"schema_version":"1.0","source":{"id":"math/0111034","kind":"arxiv","version":2}},"canonical_sha256":"b1f429d1741f4ce065d7bd44a072353f34d3097b19090e74ad8d3cb72e5bfefb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1f429d1741f4ce065d7bd44a072353f34d3097b19090e74ad8d3cb72e5bfefb","first_computed_at":"2026-07-04T14:35:36.415207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:35:36.415207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NzkPbViVSyh3Rh8uke6FEw2s+ISRmqaJ8KeTFLbXOW7myEPtKHu6jZYAMFqBuZvNbA5XwDjW/l+SDXoSDSS9Bw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:35:36.415609Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0111034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e304d93fac2f2f26594145de94ea2b2a2451b3481dac1679289f1f099329b330","sha256:a43d53506d4391796969476fb20035dd8be84c9f2179f4825586d384e7db25ac"],"state_sha256":"878fb6759c0b1a2d0ed90f3a84ce08d8c17814774ddabeefa7e6d1712cda9e69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neTDrNFVdVCGavhoefXzPpTIGeneBEs/vOOpRXXdBtwpqsFv1rUvOIlu2h76JkNJAvn6cms5YW8ok6GXmK3hAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:55:14.784539Z","bundle_sha256":"da2b587dbc86a75a4774c9ed65f5c16254eecc4afeb56cd97b2a562ce65e53ee"}}