{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XRDUMNZGXHKLHJAO2ZJRTWZTOD","short_pith_number":"pith:XRDUMNZG","schema_version":"1.0","canonical_sha256":"bc47463726b9d4b3a40ed65319db3370feb25c2a56623e8139ce4e0530cb495a","source":{"kind":"arxiv","id":"1808.04758","version":1},"attestation_state":"computed","paper":{"title":"Finding Minimal Cost Herbrand Models with Branch-Cut-and-Price","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"James Cussens","submitted_at":"2018-08-14T15:45:01Z","abstract_excerpt":"Given (1) a set of clauses $T$ in some first-order language $\\cal L$ and (2) a cost function $c : B_{{\\cal L}} \\rightarrow \\mathbb{R}_{+}$, mapping each ground atom in the Herbrand base $B_{{\\cal L}}$ to a non-negative real, then the problem of finding a minimal cost Herbrand model is to either find a Herbrand model $\\cal I$ of $T$ which is guaranteed to minimise the sum of the costs of true ground atoms, or establish that there is no Herbrand model for $T$. A branch-cut-and-price integer programming (IP) approach to solving this problem is presented. Since the number of ground instantiations "},"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":"1808.04758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-14T15:45:01Z","cross_cats_sorted":[],"title_canon_sha256":"790da310bb0276ff6022d8b02bc8e7a7172fd327d98ed92a3b3606b0e19c2d32","abstract_canon_sha256":"20618b341b148da89caf0c7687662c266b7f6fa771fa3022a427f95af3dcca64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:11.791312Z","signature_b64":"gm+Et3cF0HwC+bgfOZ9Z+t67wu8UBGOQSoj6vhWJPsqqqWfUX/k13WMeQ+3HWB8IbuYV3cUnXHHlgwULFnZCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc47463726b9d4b3a40ed65319db3370feb25c2a56623e8139ce4e0530cb495a","last_reissued_at":"2026-05-18T00:08:11.790922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:11.790922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Minimal Cost Herbrand Models with Branch-Cut-and-Price","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"James Cussens","submitted_at":"2018-08-14T15:45:01Z","abstract_excerpt":"Given (1) a set of clauses $T$ in some first-order language $\\cal L$ and (2) a cost function $c : B_{{\\cal L}} \\rightarrow \\mathbb{R}_{+}$, mapping each ground atom in the Herbrand base $B_{{\\cal L}}$ to a non-negative real, then the problem of finding a minimal cost Herbrand model is to either find a Herbrand model $\\cal I$ of $T$ which is guaranteed to minimise the sum of the costs of true ground atoms, or establish that there is no Herbrand model for $T$. A branch-cut-and-price integer programming (IP) approach to solving this problem is presented. Since the number of ground instantiations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04758","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":"1808.04758","created_at":"2026-05-18T00:08:11.790992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04758v1","created_at":"2026-05-18T00:08:11.790992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04758","created_at":"2026-05-18T00:08:11.790992+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRDUMNZGXHKL","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRDUMNZGXHKLHJAO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRDUMNZG","created_at":"2026-05-18T12:33:01.666342+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/XRDUMNZGXHKLHJAO2ZJRTWZTOD","json":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD.json","graph_json":"https://pith.science/api/pith-number/XRDUMNZGXHKLHJAO2ZJRTWZTOD/graph.json","events_json":"https://pith.science/api/pith-number/XRDUMNZGXHKLHJAO2ZJRTWZTOD/events.json","paper":"https://pith.science/paper/XRDUMNZG"},"agent_actions":{"view_html":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD","download_json":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD.json","view_paper":"https://pith.science/paper/XRDUMNZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04758&json=true","fetch_graph":"https://pith.science/api/pith-number/XRDUMNZGXHKLHJAO2ZJRTWZTOD/graph.json","fetch_events":"https://pith.science/api/pith-number/XRDUMNZGXHKLHJAO2ZJRTWZTOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD/action/storage_attestation","attest_author":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD/action/author_attestation","sign_citation":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD/action/citation_signature","submit_replication":"https://pith.science/pith/XRDUMNZGXHKLHJAO2ZJRTWZTOD/action/replication_record"}},"created_at":"2026-05-18T00:08:11.790992+00:00","updated_at":"2026-05-18T00:08:11.790992+00:00"}