{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7LTWW75NRR6TEARFMF3GYLVM7H","short_pith_number":"pith:7LTWW75N","schema_version":"1.0","canonical_sha256":"fae76b7fad8c7d32022561766c2eacf9e1520467b9d8e577d931d0e4287b17dd","source":{"kind":"arxiv","id":"1801.07528","version":4},"attestation_state":"computed","paper":{"title":"Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Filip Mari\\'c, Marko Malikovi\\'c, Predrag Jani\\v{c}i\\'c","submitted_at":"2018-01-23T13:26:35Z","abstract_excerpt":"There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy for the chess KRK endgame. The final, machine verifiable, result presented in this paper is that there is a winning strategy for white in the KRK endgame generalized to $n \\times n$ board (for natural $n$ greater than $3$). We demonstrate that different approaches for computer-based theorem proving work best together and in synergy and that the technology cur"},"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":"1801.07528","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-01-23T13:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"44a93f852510d473f962a6d046765775c4a28d990408d4a0728dae5ade840fc5","abstract_canon_sha256":"d57b19770631a3ac7070130ff25a84d995ae5dbf23582d02bf598d44e1eaf0f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:22.865235Z","signature_b64":"WAv732GFKoL1mDX3SpJMU+nPZjYVpalPHh5zSMlBjO1V3TYVho159beoNX4rH0F8kD6h65nggjKFt1HeckSiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae76b7fad8c7d32022561766c2eacf9e1520467b9d8e577d931d0e4287b17dd","last_reissued_at":"2026-07-05T06:23:22.864888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:22.864888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Filip Mari\\'c, Marko Malikovi\\'c, Predrag Jani\\v{c}i\\'c","submitted_at":"2018-01-23T13:26:35Z","abstract_excerpt":"There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy for the chess KRK endgame. The final, machine verifiable, result presented in this paper is that there is a winning strategy for white in the KRK endgame generalized to $n \\times n$ board (for natural $n$ greater than $3$). We demonstrate that different approaches for computer-based theorem proving work best together and in synergy and that the technology cur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07528","kind":"arxiv","version":4},"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/1801.07528/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":"1801.07528","created_at":"2026-07-05T06:23:22.864949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07528v4","created_at":"2026-07-05T06:23:22.864949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07528","created_at":"2026-07-05T06:23:22.864949+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LTWW75NRR6T","created_at":"2026-07-05T06:23:22.864949+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LTWW75NRR6TEARF","created_at":"2026-07-05T06:23:22.864949+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LTWW75N","created_at":"2026-07-05T06:23:22.864949+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/7LTWW75NRR6TEARFMF3GYLVM7H","json":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H.json","graph_json":"https://pith.science/api/pith-number/7LTWW75NRR6TEARFMF3GYLVM7H/graph.json","events_json":"https://pith.science/api/pith-number/7LTWW75NRR6TEARFMF3GYLVM7H/events.json","paper":"https://pith.science/paper/7LTWW75N"},"agent_actions":{"view_html":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H","download_json":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H.json","view_paper":"https://pith.science/paper/7LTWW75N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07528&json=true","fetch_graph":"https://pith.science/api/pith-number/7LTWW75NRR6TEARFMF3GYLVM7H/graph.json","fetch_events":"https://pith.science/api/pith-number/7LTWW75NRR6TEARFMF3GYLVM7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H/action/storage_attestation","attest_author":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H/action/author_attestation","sign_citation":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H/action/citation_signature","submit_replication":"https://pith.science/pith/7LTWW75NRR6TEARFMF3GYLVM7H/action/replication_record"}},"created_at":"2026-07-05T06:23:22.864949+00:00","updated_at":"2026-07-05T06:23:22.864949+00:00"}