{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM","short_pith_number":"pith:Z3DCU5YC","schema_version":"1.0","canonical_sha256":"cec62a77024fc2b093905d9f34fa7bcb201dc604b1a4cb4f37ef97288f8a1c78","source":{"kind":"arxiv","id":"2410.23621","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on forcing numbers based on height functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fateh Aliyev, Nikita Gladkov","submitted_at":"2024-10-31T04:19:37Z","abstract_excerpt":"We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases."},"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":"2410.23621","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-31T04:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"8c9010fa7980524ac07a705d15bd241ecdbb49757c6c5460a6cdd98ba47fd7c9","abstract_canon_sha256":"faabbd3db84169efacad6bf82c7f4c76be5d656ca45a072dd332b309be41136c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:02.806968Z","signature_b64":"m2gYO2a1z3WQFnPu4V6Y4xLwBHjQbBtcfZYik3Fe4e0jZQ+rqci86DidXQoreHOwqQoiwfYUVDbZ1/3gJrpXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec62a77024fc2b093905d9f34fa7bcb201dc604b1a4cb4f37ef97288f8a1c78","last_reissued_at":"2026-07-05T09:29:02.806590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:02.806590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on forcing numbers based on height functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fateh Aliyev, Nikita Gladkov","submitted_at":"2024-10-31T04:19:37Z","abstract_excerpt":"We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23621","kind":"arxiv","version":1},"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/2410.23621/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":"2410.23621","created_at":"2026-07-05T09:29:02.806657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23621v1","created_at":"2026-07-05T09:29:02.806657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23621","created_at":"2026-07-05T09:29:02.806657+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3DCU5YCJ7BL","created_at":"2026-07-05T09:29:02.806657+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3DCU5YCJ7BLBE4Q","created_at":"2026-07-05T09:29:02.806657+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3DCU5YC","created_at":"2026-07-05T09:29:02.806657+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/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM","json":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM.json","graph_json":"https://pith.science/api/pith-number/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/graph.json","events_json":"https://pith.science/api/pith-number/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/events.json","paper":"https://pith.science/paper/Z3DCU5YC"},"agent_actions":{"view_html":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM","download_json":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM.json","view_paper":"https://pith.science/paper/Z3DCU5YC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23621&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/action/storage_attestation","attest_author":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/action/author_attestation","sign_citation":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/action/citation_signature","submit_replication":"https://pith.science/pith/Z3DCU5YCJ7BLBE4QLWPTJ6T3ZM/action/replication_record"}},"created_at":"2026-07-05T09:29:02.806657+00:00","updated_at":"2026-07-05T09:29:02.806657+00:00"}