{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:REBCBIAGLUDQWKVH2YHZFD26XX","short_pith_number":"pith:REBCBIAG","schema_version":"1.0","canonical_sha256":"890220a0065d070b2aa7d60f928f5ebdde0728fe35cca07462832cdf96fb4d45","source":{"kind":"arxiv","id":"1303.6453","version":1},"attestation_state":"computed","paper":{"title":"Feasible combinatorial matrix theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Ariel Fern\\'andez, Michael Soltys","submitted_at":"2013-03-26T12:30:36Z","abstract_excerpt":"We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\\LA$ with induction restricted to $\\Sigma_1^B$ formulas. This is an improvement over the standard textbook proof of KMM which requires $\\Pi_2^B$ induction, and hence does not yield feasible proofs --- while our new approach does. $\\LA$ is a weak theory that essentially captures the ring properties of matrices; however, equipped with $\\Sigma_1^B$ induction $\\LA$ is capable of proving KMM, and a host of other combinatorial properties such as Men"},"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":"1303.6453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-26T12:30:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"891f670bc922fd8081521e621fbf946223188e85b71844e7324ed0f4632e13e9","abstract_canon_sha256":"b289844e32632c218917570d58b7e784f4626cad51ffd5c2c3305f4b9cde6407"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.416718Z","signature_b64":"bKXTuwfhS9FPNPbD866aSgiFxXUIv22cOImMypNYcj679Vsjd8o2/ZnYLL52nAMq5Vrgj7mYLtXsnC0UJp1nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"890220a0065d070b2aa7d60f928f5ebdde0728fe35cca07462832cdf96fb4d45","last_reissued_at":"2026-05-18T03:29:49.416040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.416040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feasible combinatorial matrix theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Ariel Fern\\'andez, Michael Soltys","submitted_at":"2013-03-26T12:30:36Z","abstract_excerpt":"We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\\LA$ with induction restricted to $\\Sigma_1^B$ formulas. This is an improvement over the standard textbook proof of KMM which requires $\\Pi_2^B$ induction, and hence does not yield feasible proofs --- while our new approach does. $\\LA$ is a weak theory that essentially captures the ring properties of matrices; however, equipped with $\\Sigma_1^B$ induction $\\LA$ is capable of proving KMM, and a host of other combinatorial properties such as Men"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6453","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":"1303.6453","created_at":"2026-05-18T03:29:49.416144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6453v1","created_at":"2026-05-18T03:29:49.416144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6453","created_at":"2026-05-18T03:29:49.416144+00:00"},{"alias_kind":"pith_short_12","alias_value":"REBCBIAGLUDQ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"REBCBIAGLUDQWKVH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"REBCBIAG","created_at":"2026-05-18T12:27:57.521954+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/REBCBIAGLUDQWKVH2YHZFD26XX","json":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX.json","graph_json":"https://pith.science/api/pith-number/REBCBIAGLUDQWKVH2YHZFD26XX/graph.json","events_json":"https://pith.science/api/pith-number/REBCBIAGLUDQWKVH2YHZFD26XX/events.json","paper":"https://pith.science/paper/REBCBIAG"},"agent_actions":{"view_html":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX","download_json":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX.json","view_paper":"https://pith.science/paper/REBCBIAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6453&json=true","fetch_graph":"https://pith.science/api/pith-number/REBCBIAGLUDQWKVH2YHZFD26XX/graph.json","fetch_events":"https://pith.science/api/pith-number/REBCBIAGLUDQWKVH2YHZFD26XX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX/action/storage_attestation","attest_author":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX/action/author_attestation","sign_citation":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX/action/citation_signature","submit_replication":"https://pith.science/pith/REBCBIAGLUDQWKVH2YHZFD26XX/action/replication_record"}},"created_at":"2026-05-18T03:29:49.416144+00:00","updated_at":"2026-05-18T03:29:49.416144+00:00"}