{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LKCSMQXDPUVEUJPVMKQNAS52QB","short_pith_number":"pith:LKCSMQXD","schema_version":"1.0","canonical_sha256":"5a852642e37d2a4a25f562a0d04bba804c0dd5e1dded6bafadc159259162107c","source":{"kind":"arxiv","id":"1902.03431","version":1},"attestation_state":"computed","paper":{"title":"On the maximal minimal cube lengths in distinct DNF tautologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Manuel Kauers, Martina Seidl","submitted_at":"2019-02-09T15:03:37Z","abstract_excerpt":"Inspired by a recent article by Anthony Zaleski and Doron Zeilberger, we investigate the question of determining the largest k for which there exists boolean formulas in disjunctive normal form (DNF) with n variables, none of whose conjunctions are `parallel', and such that all of them have at least k literals. Using a SAT solver, we answer some of the questions they left open. We also determine the corresponding numbers for DNFs obeying certain symmetries."},"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":"1902.03431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T15:03:37Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"524ce6654aed0fda96d408d2c56e2ff199da51b0a580da3b856932bcac1b8717","abstract_canon_sha256":"27f6c210107db15c83d60cb03ac1e2b7728840416367d0cf05a4227eadd483a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.843024Z","signature_b64":"wpEclePDlBxSZbKOYOk4fggdZCou7RLBWQYnm6hXdyUu9pmqY4P11hXMlZwYhopCcsjMUwAmJHH3QDqtZwooCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a852642e37d2a4a25f562a0d04bba804c0dd5e1dded6bafadc159259162107c","last_reissued_at":"2026-05-17T23:54:20.842548Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.842548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximal minimal cube lengths in distinct DNF tautologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Manuel Kauers, Martina Seidl","submitted_at":"2019-02-09T15:03:37Z","abstract_excerpt":"Inspired by a recent article by Anthony Zaleski and Doron Zeilberger, we investigate the question of determining the largest k for which there exists boolean formulas in disjunctive normal form (DNF) with n variables, none of whose conjunctions are `parallel', and such that all of them have at least k literals. Using a SAT solver, we answer some of the questions they left open. We also determine the corresponding numbers for DNFs obeying certain symmetries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03431","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":"1902.03431","created_at":"2026-05-17T23:54:20.842608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03431v1","created_at":"2026-05-17T23:54:20.842608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03431","created_at":"2026-05-17T23:54:20.842608+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKCSMQXDPUVE","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKCSMQXDPUVEUJPV","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKCSMQXD","created_at":"2026-05-18T12:33:21.387695+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/LKCSMQXDPUVEUJPVMKQNAS52QB","json":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB.json","graph_json":"https://pith.science/api/pith-number/LKCSMQXDPUVEUJPVMKQNAS52QB/graph.json","events_json":"https://pith.science/api/pith-number/LKCSMQXDPUVEUJPVMKQNAS52QB/events.json","paper":"https://pith.science/paper/LKCSMQXD"},"agent_actions":{"view_html":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB","download_json":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB.json","view_paper":"https://pith.science/paper/LKCSMQXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03431&json=true","fetch_graph":"https://pith.science/api/pith-number/LKCSMQXDPUVEUJPVMKQNAS52QB/graph.json","fetch_events":"https://pith.science/api/pith-number/LKCSMQXDPUVEUJPVMKQNAS52QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB/action/storage_attestation","attest_author":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB/action/author_attestation","sign_citation":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB/action/citation_signature","submit_replication":"https://pith.science/pith/LKCSMQXDPUVEUJPVMKQNAS52QB/action/replication_record"}},"created_at":"2026-05-17T23:54:20.842608+00:00","updated_at":"2026-05-17T23:54:20.842608+00:00"}