{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4FGT2M4AUITRFCKKX6PNUZK2JA","short_pith_number":"pith:4FGT2M4A","schema_version":"1.0","canonical_sha256":"e14d3d3380a22712894abf9eda655a482d4658fcb5f5ff76644b3c9892f6b660","source":{"kind":"arxiv","id":"2411.04147","version":2},"attestation_state":"computed","paper":{"title":"Regular structures of an intractable enumeration problem: a diagonal recurrence relation of monomer-polymer coverings on two-dimensional rectangular lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.CO","authors_text":"Yong Kong","submitted_at":"2024-11-05T18:47:46Z","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!}"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.04147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-05T18:47:46Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"5e8ce03ae5c3adf0dbfb5882d2a293713ef03c31ba076eedb68663c0055eaa98","abstract_canon_sha256":"9b51cc906c1f3016710e132daff4d27d2a38187cdc2d0b401926cd14805112ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:26.294794Z","signature_b64":"6Snp5YyAc67pP5DkGOc3BPh5hMkf+cgXXx9EvjDLJfD7wmnDM14aQZ2J+OcI/DEjJMYJpMfAU6Sa/YW0JNFjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14d3d3380a22712894abf9eda655a482d4658fcb5f5ff76644b3c9892f6b660","last_reissued_at":"2026-05-20T00:05:26.293886Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:26.293886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular structures of an intractable enumeration problem: a diagonal recurrence relation of monomer-polymer coverings on two-dimensional rectangular lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.CO","authors_text":"Yong Kong","submitted_at":"2024-11-05T18:47:46Z","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!}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04147","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/2411.04147/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.04147","created_at":"2026-05-20T00:05:26.294033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04147v2","created_at":"2026-05-20T00:05:26.294033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04147","created_at":"2026-05-20T00:05:26.294033+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FGT2M4AUITR","created_at":"2026-05-20T00:05:26.294033+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FGT2M4AUITRFCKK","created_at":"2026-05-20T00:05:26.294033+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FGT2M4A","created_at":"2026-05-20T00:05:26.294033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA","json":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA.json","graph_json":"https://pith.science/api/pith-number/4FGT2M4AUITRFCKKX6PNUZK2JA/graph.json","events_json":"https://pith.science/api/pith-number/4FGT2M4AUITRFCKKX6PNUZK2JA/events.json","paper":"https://pith.science/paper/4FGT2M4A"},"agent_actions":{"view_html":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA","download_json":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA.json","view_paper":"https://pith.science/paper/4FGT2M4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04147&json=true","fetch_graph":"https://pith.science/api/pith-number/4FGT2M4AUITRFCKKX6PNUZK2JA/graph.json","fetch_events":"https://pith.science/api/pith-number/4FGT2M4AUITRFCKKX6PNUZK2JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA/action/storage_attestation","attest_author":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA/action/author_attestation","sign_citation":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA/action/citation_signature","submit_replication":"https://pith.science/pith/4FGT2M4AUITRFCKKX6PNUZK2JA/action/replication_record"}},"created_at":"2026-05-20T00:05:26.294033+00:00","updated_at":"2026-05-20T00:05:26.294033+00:00"}