{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4FGT2M4AUITRFCKKX6PNUZK2JA","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":"9b51cc906c1f3016710e132daff4d27d2a38187cdc2d0b401926cd14805112ea","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-05T18:47:46Z","title_canon_sha256":"5e8ce03ae5c3adf0dbfb5882d2a293713ef03c31ba076eedb68663c0055eaa98"},"schema_version":"1.0","source":{"id":"2411.04147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.04147","created_at":"2026-05-20T00:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2411.04147v2","created_at":"2026-05-20T00:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04147","created_at":"2026-05-20T00:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"4FGT2M4AUITR","created_at":"2026-05-20T00:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"4FGT2M4AUITRFCKK","created_at":"2026-05-20T00:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"4FGT2M4A","created_at":"2026-05-20T00:05:26Z"}],"graph_snapshots":[{"event_id":"sha256:61c9002cfbc640ae30eb1bfefe9d09f359dc854a0b3a086e53d59766533be9c8","target":"graph","created_at":"2026-05-20T00:05:26Z","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/2411.04147/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The well-known monomer-dimer model is a special case of the monomer-polymer model with $k=2$. The enumeration of polymer coverings on two-dimensional rectangular lattices is considered as \"intractable\". We prove that the number of coverings of $s$ polymer satisfies a simple recurrence relation $\\sum_{i=0}^{2s} (-1)^i \\binom{2s}{i} a_{n-i, m-i} = 2^s {(2s)!} / {s!}","authors_text":"Yong Kong","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-05T18:47:46Z","title":"Regular structures of an intractable enumeration problem: a diagonal recurrence relation of monomer-polymer coverings on two-dimensional rectangular lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04147","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:9027c56ca4f31aaf8580c3b578169b7a07f3ec751359b465ed8de39309a1bb7d","target":"record","created_at":"2026-05-20T00:05:26Z","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":"9b51cc906c1f3016710e132daff4d27d2a38187cdc2d0b401926cd14805112ea","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-05T18:47:46Z","title_canon_sha256":"5e8ce03ae5c3adf0dbfb5882d2a293713ef03c31ba076eedb68663c0055eaa98"},"schema_version":"1.0","source":{"id":"2411.04147","kind":"arxiv","version":2}},"canonical_sha256":"e14d3d3380a22712894abf9eda655a482d4658fcb5f5ff76644b3c9892f6b660","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e14d3d3380a22712894abf9eda655a482d4658fcb5f5ff76644b3c9892f6b660","first_computed_at":"2026-05-20T00:05:26.293886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:26.293886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Snp5YyAc67pP5DkGOc3BPh5hMkf+cgXXx9EvjDLJfD7wmnDM14aQZ2J+OcI/DEjJMYJpMfAU6Sa/YW0JNFjDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:26.294794Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.04147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9027c56ca4f31aaf8580c3b578169b7a07f3ec751359b465ed8de39309a1bb7d","sha256:61c9002cfbc640ae30eb1bfefe9d09f359dc854a0b3a086e53d59766533be9c8"],"state_sha256":"43e1b0a770fd1acb7755d072b3456ebca279880b29651a4d6398bec554f666fa"}