{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HPI57G2SHAY327OL4UIIYTNTMG","short_pith_number":"pith:HPI57G2S","schema_version":"1.0","canonical_sha256":"3bd1df9b523831bd7dcbe5108c4db3619035ed3a302789000539b63dfa5eaa9f","source":{"kind":"arxiv","id":"1906.03085","version":1},"attestation_state":"computed","paper":{"title":"CoAPI: An Efficient Two-Phase Algorithm Using Core-Guided Over-Approximate Cover for Prime Compilation of Non-Clausal Formulae","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Hai Wan, Hongzhen Zhong, Ou Wei, Weilin Luo","submitted_at":"2019-06-07T13:26:39Z","abstract_excerpt":"Prime compilation, i.e., the generation of all prime implicates or implicants (primes for short) of formulae, is a prominent fundamental issue for AI. Recently, the prime compilation for non-clausal formulae has received great attention. The state-of-the-art approaches generate all primes along with a prime cover constructed by prime implicates using dual rail encoding. However, the dual rail encoding potentially expands search space. In addition, constructing a prime cover, which is necessary for their methods, is time-consuming. To address these issues, we propose a novel two-phase method --"},"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":"1906.03085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-07T13:26:39Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6640c4ab883c96b9c595fc897791ddc7bad9cdd2110214aa18f57d0fee771f42","abstract_canon_sha256":"21ba3438fff4d83b358eb178053a2a77e437a56b4ffe6c12150c4ef986085711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:55.066365Z","signature_b64":"cKHDfTDUruSKo4ezry19LfvYsiSKUDo9eKkZsX/xVrUmTPWrTbUJbH1GtkzKVtSnmtYLcnfzhNmdUurwavQpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bd1df9b523831bd7dcbe5108c4db3619035ed3a302789000539b63dfa5eaa9f","last_reissued_at":"2026-05-17T23:43:55.065774Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:55.065774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoAPI: An Efficient Two-Phase Algorithm Using Core-Guided Over-Approximate Cover for Prime Compilation of Non-Clausal Formulae","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Hai Wan, Hongzhen Zhong, Ou Wei, Weilin Luo","submitted_at":"2019-06-07T13:26:39Z","abstract_excerpt":"Prime compilation, i.e., the generation of all prime implicates or implicants (primes for short) of formulae, is a prominent fundamental issue for AI. Recently, the prime compilation for non-clausal formulae has received great attention. The state-of-the-art approaches generate all primes along with a prime cover constructed by prime implicates using dual rail encoding. However, the dual rail encoding potentially expands search space. In addition, constructing a prime cover, which is necessary for their methods, is time-consuming. To address these issues, we propose a novel two-phase method --"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03085","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":"1906.03085","created_at":"2026-05-17T23:43:55.065895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03085v1","created_at":"2026-05-17T23:43:55.065895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03085","created_at":"2026-05-17T23:43:55.065895+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPI57G2SHAY3","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPI57G2SHAY327OL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPI57G2S","created_at":"2026-05-18T12:33:18.533446+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/HPI57G2SHAY327OL4UIIYTNTMG","json":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG.json","graph_json":"https://pith.science/api/pith-number/HPI57G2SHAY327OL4UIIYTNTMG/graph.json","events_json":"https://pith.science/api/pith-number/HPI57G2SHAY327OL4UIIYTNTMG/events.json","paper":"https://pith.science/paper/HPI57G2S"},"agent_actions":{"view_html":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG","download_json":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG.json","view_paper":"https://pith.science/paper/HPI57G2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03085&json=true","fetch_graph":"https://pith.science/api/pith-number/HPI57G2SHAY327OL4UIIYTNTMG/graph.json","fetch_events":"https://pith.science/api/pith-number/HPI57G2SHAY327OL4UIIYTNTMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG/action/storage_attestation","attest_author":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG/action/author_attestation","sign_citation":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG/action/citation_signature","submit_replication":"https://pith.science/pith/HPI57G2SHAY327OL4UIIYTNTMG/action/replication_record"}},"created_at":"2026-05-17T23:43:55.065895+00:00","updated_at":"2026-05-17T23:43:55.065895+00:00"}