{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q7RH3ZTLTUQSMBGBO6E6OGLUX3","short_pith_number":"pith:Q7RH3ZTL","schema_version":"1.0","canonical_sha256":"87e27de66b9d212604c17789e71974bed0ca2c2ce4b2d0fc95d5876fc994182c","source":{"kind":"arxiv","id":"2201.12827","version":2},"attestation_state":"computed","paper":{"title":"Counting lattice triangulations: Fredholm equations in combinatorics","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"S. Yu. Orevkov","submitted_at":"2022-01-30T14:19:45Z","abstract_excerpt":"Let $f(m,n)$ be the number of primitive lattice triangulations of $m\\times n$ rectangle. We compute the limits $\\lim_n f(m,n)^{1/n}$ for $m=2$ and $3$. For $m=2$ we obtain the exact value of the limit which is equal to $(611+\\sqrt{73})/36$. For $m=3$, we express the limit in terms of certain Fredholm's integral equation on generating functions. This provides a polynomial time algorithm for computation of the limit with any given precision (polynomial with respect the the number of computed digits)."},"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":"2201.12827","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2022-01-30T14:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"5e7085424625319e64b375d55f6333b2de05e3e370e7e300fd0fe48c8f7ef49c","abstract_canon_sha256":"172551004318ab20576a1a69134ff10c4da90a0b1374cb1f59097ae80ee76dbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:17.059699Z","signature_b64":"6H8ProD8NX5c+a7shzaGyPi6x3cC6V//BoEtrC+54/0sdSrkyQ/qCsuStu31tDIQPTd3w8QR71LrWySm4FqnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e27de66b9d212604c17789e71974bed0ca2c2ce4b2d0fc95d5876fc994182c","last_reissued_at":"2026-07-05T09:42:17.059123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:17.059123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting lattice triangulations: Fredholm equations in combinatorics","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"S. Yu. Orevkov","submitted_at":"2022-01-30T14:19:45Z","abstract_excerpt":"Let $f(m,n)$ be the number of primitive lattice triangulations of $m\\times n$ rectangle. We compute the limits $\\lim_n f(m,n)^{1/n}$ for $m=2$ and $3$. For $m=2$ we obtain the exact value of the limit which is equal to $(611+\\sqrt{73})/36$. For $m=3$, we express the limit in terms of certain Fredholm's integral equation on generating functions. This provides a polynomial time algorithm for computation of the limit with any given precision (polynomial with respect the the number of computed digits)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12827","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/2201.12827/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":"2201.12827","created_at":"2026-07-05T09:42:17.059210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12827v2","created_at":"2026-07-05T09:42:17.059210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12827","created_at":"2026-07-05T09:42:17.059210+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7RH3ZTLTUQS","created_at":"2026-07-05T09:42:17.059210+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7RH3ZTLTUQSMBGB","created_at":"2026-07-05T09:42:17.059210+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7RH3ZTL","created_at":"2026-07-05T09:42:17.059210+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/Q7RH3ZTLTUQSMBGBO6E6OGLUX3","json":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3.json","graph_json":"https://pith.science/api/pith-number/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/graph.json","events_json":"https://pith.science/api/pith-number/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/events.json","paper":"https://pith.science/paper/Q7RH3ZTL"},"agent_actions":{"view_html":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3","download_json":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3.json","view_paper":"https://pith.science/paper/Q7RH3ZTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12827&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/action/storage_attestation","attest_author":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/action/author_attestation","sign_citation":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/action/citation_signature","submit_replication":"https://pith.science/pith/Q7RH3ZTLTUQSMBGBO6E6OGLUX3/action/replication_record"}},"created_at":"2026-07-05T09:42:17.059210+00:00","updated_at":"2026-07-05T09:42:17.059210+00:00"}