{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JJXTBTCNF3Y33E7NHPSWH4UI64","short_pith_number":"pith:JJXTBTCN","schema_version":"1.0","canonical_sha256":"4a6f30cc4d2ef1bd93ed3be563f288f73a050ae0d9e36976121386170fc4dde5","source":{"kind":"arxiv","id":"1703.06133","version":1},"attestation_state":"computed","paper":{"title":"Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Abhishek Kr Singh","submitted_at":"2017-03-17T17:55:35Z","abstract_excerpt":"We present two fully mechanized proofs of Dilworths and Mirskys theorems in the Coq proof assistant. Dilworths Theorem states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirskys Theorem is a dual of Dilworths Theorem. We formalize the proofs by Perles [2] (for Dilworths Theorem) and by Mirsky [5] (for the dual theorem). We also come up with a library of definitions and facts that can be used as a framework for formalizing other theorems on finite posets."},"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":"1703.06133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-17T17:55:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f5993b48ab234bfe139a138356f26086a27ae4e03ff88ca103a6b3c1cd0870d5","abstract_canon_sha256":"60060c39091d196d108c5837a0e58f813f43cd146a57277032e54f485f2c8e90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.399404Z","signature_b64":"nvY5fsUidQxuqLGj7Bl2c3dxyrcMIxtLBQJyf5Hi/+v6RgSk461HXbaDAiMw6xEe5g0Vea2pGZihvIrBdN8GCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6f30cc4d2ef1bd93ed3be563f288f73a050ae0d9e36976121386170fc4dde5","last_reissued_at":"2026-05-18T00:48:29.398919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.398919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Abhishek Kr Singh","submitted_at":"2017-03-17T17:55:35Z","abstract_excerpt":"We present two fully mechanized proofs of Dilworths and Mirskys theorems in the Coq proof assistant. Dilworths Theorem states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirskys Theorem is a dual of Dilworths Theorem. We formalize the proofs by Perles [2] (for Dilworths Theorem) and by Mirsky [5] (for the dual theorem). We also come up with a library of definitions and facts that can be used as a framework for formalizing other theorems on finite posets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06133","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":""},"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":"1703.06133","created_at":"2026-05-18T00:48:29.398986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06133v1","created_at":"2026-05-18T00:48:29.398986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06133","created_at":"2026-05-18T00:48:29.398986+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJXTBTCNF3Y3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJXTBTCNF3Y33E7N","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJXTBTCN","created_at":"2026-05-18T12:31:24.725408+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/JJXTBTCNF3Y33E7NHPSWH4UI64","json":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64.json","graph_json":"https://pith.science/api/pith-number/JJXTBTCNF3Y33E7NHPSWH4UI64/graph.json","events_json":"https://pith.science/api/pith-number/JJXTBTCNF3Y33E7NHPSWH4UI64/events.json","paper":"https://pith.science/paper/JJXTBTCN"},"agent_actions":{"view_html":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64","download_json":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64.json","view_paper":"https://pith.science/paper/JJXTBTCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06133&json=true","fetch_graph":"https://pith.science/api/pith-number/JJXTBTCNF3Y33E7NHPSWH4UI64/graph.json","fetch_events":"https://pith.science/api/pith-number/JJXTBTCNF3Y33E7NHPSWH4UI64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64/action/storage_attestation","attest_author":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64/action/author_attestation","sign_citation":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64/action/citation_signature","submit_replication":"https://pith.science/pith/JJXTBTCNF3Y33E7NHPSWH4UI64/action/replication_record"}},"created_at":"2026-05-18T00:48:29.398986+00:00","updated_at":"2026-05-18T00:48:29.398986+00:00"}