{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MH35KVCSUVA2IQ2UBFQMXOWOHZ","short_pith_number":"pith:MH35KVCS","canonical_record":{"source":{"id":"1210.5189","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T17:05:26Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"7becfe748748614d01732a9ed177350062cba16acb260a646931963dabd0bae3","abstract_canon_sha256":"ac29b6efa4c314e15faf71a11009e1b6719d38c1f3d50d3e1148f70563281e5e"},"schema_version":"1.0"},"canonical_sha256":"61f7d55452a541a443540960cbbace3e70d07d2afd392436a9d4450aa663898c","source":{"kind":"arxiv","id":"1210.5189","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5189","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5189v3","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5189","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"MH35KVCSUVA2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MH35KVCSUVA2IQ2U","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MH35KVCS","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MH35KVCSUVA2IQ2UBFQMXOWOHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5189","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T17:05:26Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"7becfe748748614d01732a9ed177350062cba16acb260a646931963dabd0bae3","abstract_canon_sha256":"ac29b6efa4c314e15faf71a11009e1b6719d38c1f3d50d3e1148f70563281e5e"},"schema_version":"1.0"},"canonical_sha256":"61f7d55452a541a443540960cbbace3e70d07d2afd392436a9d4450aa663898c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:15.245784Z","signature_b64":"cu8Q2ngFto9lJAIs4AdmvV6kZGbGoH7qKss2Re4xUhztQaB62mAzPDY1rbj7WLlrpLHAw6XX5r8HVLlQINpPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f7d55452a541a443540960cbbace3e70d07d2afd392436a9d4450aa663898c","last_reissued_at":"2026-05-18T02:51:15.245351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:15.245351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5189","source_version":3,"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-18T02:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQDLThbU2Dq2BYADEmYDgWF4oA183bT7F+zldmrVAOPBTXO1qWYbv5qKEqE/lDVIazQEeQgUhp3y5a2vboyEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:01:29.010494Z"},"content_sha256":"8d40bd96b79cd5195da4647e0cb8dcbc4d554ad12be45635c92bd2b865e160b4","schema_version":"1.0","event_id":"sha256:8d40bd96b79cd5195da4647e0cb8dcbc4d554ad12be45635c92bd2b865e160b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MH35KVCSUVA2IQ2UBFQMXOWOHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accurate lower bounds on two-dimensional constraint capacities from corner transfer matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.CO","authors_text":"Andrew Rechnitzer, Yao-ban Chan","submitted_at":"2012-10-18T17:05:26Z","abstract_excerpt":"We analyse the capacity of several two-dimensional constraint families - the exclusion, colouring, parity and charge model families. Using Baxter's corner transfer matrix formalism combined with the corner transfer matrix renormalisation group method of Nishino and Okunishi, we calculate very tight lower bounds and estimates on the growth rate of these models. Our results strongly improve previous known lower bounds, and lead to the surprising conjecture that the capacity of the even and charge(3) constraints are identical."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5189","kind":"arxiv","version":3},"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-18T02:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMTHMpl+/fza7sSlyrBX/m5vt6jAjztNLmg4HOI1C3lJzYm39O9b5LYjtS3Lpc/Jk2tmUmQp6D5crwVNNtb7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:01:29.010826Z"},"content_sha256":"7c1514d05fc7f136e55e9e7cdf58972154b35ad6599dc39f0de57bcbe90c5134","schema_version":"1.0","event_id":"sha256:7c1514d05fc7f136e55e9e7cdf58972154b35ad6599dc39f0de57bcbe90c5134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ/bundle.json","state_url":"https://pith.science/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ/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-09T01:01:29Z","links":{"resolver":"https://pith.science/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ","bundle":"https://pith.science/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ/bundle.json","state":"https://pith.science/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MH35KVCSUVA2IQ2UBFQMXOWOHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MH35KVCSUVA2IQ2UBFQMXOWOHZ","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":"ac29b6efa4c314e15faf71a11009e1b6719d38c1f3d50d3e1148f70563281e5e","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T17:05:26Z","title_canon_sha256":"7becfe748748614d01732a9ed177350062cba16acb260a646931963dabd0bae3"},"schema_version":"1.0","source":{"id":"1210.5189","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5189","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5189v3","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5189","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"MH35KVCSUVA2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MH35KVCSUVA2IQ2U","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MH35KVCS","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:7c1514d05fc7f136e55e9e7cdf58972154b35ad6599dc39f0de57bcbe90c5134","target":"graph","created_at":"2026-05-18T02:51:15Z","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":"We analyse the capacity of several two-dimensional constraint families - the exclusion, colouring, parity and charge model families. Using Baxter's corner transfer matrix formalism combined with the corner transfer matrix renormalisation group method of Nishino and Okunishi, we calculate very tight lower bounds and estimates on the growth rate of these models. Our results strongly improve previous known lower bounds, and lead to the surprising conjecture that the capacity of the even and charge(3) constraints are identical.","authors_text":"Andrew Rechnitzer, Yao-ban Chan","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T17:05:26Z","title":"Accurate lower bounds on two-dimensional constraint capacities from corner transfer matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5189","kind":"arxiv","version":3},"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:8d40bd96b79cd5195da4647e0cb8dcbc4d554ad12be45635c92bd2b865e160b4","target":"record","created_at":"2026-05-18T02:51:15Z","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":"ac29b6efa4c314e15faf71a11009e1b6719d38c1f3d50d3e1148f70563281e5e","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T17:05:26Z","title_canon_sha256":"7becfe748748614d01732a9ed177350062cba16acb260a646931963dabd0bae3"},"schema_version":"1.0","source":{"id":"1210.5189","kind":"arxiv","version":3}},"canonical_sha256":"61f7d55452a541a443540960cbbace3e70d07d2afd392436a9d4450aa663898c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61f7d55452a541a443540960cbbace3e70d07d2afd392436a9d4450aa663898c","first_computed_at":"2026-05-18T02:51:15.245351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:15.245351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cu8Q2ngFto9lJAIs4AdmvV6kZGbGoH7qKss2Re4xUhztQaB62mAzPDY1rbj7WLlrpLHAw6XX5r8HVLlQINpPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:15.245784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5189","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d40bd96b79cd5195da4647e0cb8dcbc4d554ad12be45635c92bd2b865e160b4","sha256:7c1514d05fc7f136e55e9e7cdf58972154b35ad6599dc39f0de57bcbe90c5134"],"state_sha256":"91c428c05c0fc3a5811046e28b27ebde8ac9f1135ca30d290becd514f3126890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlyEcLFGrjPsQ3iQbu1nryz8fVmJJjDPdiOOyFKdVgugRJTVC0JL6LaY/G0CrD4u/2evqq7Y2sC+A3hDJjGrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:01:29.012640Z","bundle_sha256":"2fab2972ec55183b72c531337fb9225ba61659eb4ad99474b1580c8f7e879559"}}