{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RVHVOFRQOA6NBXZAHUOCQPL44F","short_pith_number":"pith:RVHVOFRQ","schema_version":"1.0","canonical_sha256":"8d4f571630703cd0df203d1c283d7ce151ed994e21f9a03e183b3f8d6eff86c5","source":{"kind":"arxiv","id":"1205.2644","version":1},"attestation_state":"computed","paper":{"title":"First-Order Mixed Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Geoffrey Gordon, Miroslav Dudik, Sue Ann Hong","submitted_at":"2012-05-09T15:25:08Z","abstract_excerpt":"Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations. First-order logic (FOL), on the other hand, excels at reasoning about classes of objects, but lacks a rich representation of uncertainty. While representing propositional logic in MILP has been extensively explored, no theory exists yet for fully combining FOL with MILP. We propose a new representation, called first-order programming or FOP, which subsumes both F"},"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":"1205.2644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-09T15:25:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"24d2e04200301338252119f30c57c56b286433f66e442e4a673525d4a4642f8e","abstract_canon_sha256":"b31e1399c1f7315c3a41b875221c161beb2779cedcc78927dea5ab46c1f96b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.674962Z","signature_b64":"aLNiXGwq4j4d2zd+dJeVJut7NAzpcqSCcLnm5coYrW7mCZfSwv4pLZH0OlvlbslFS4xg8BNydotpCajOkgrrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d4f571630703cd0df203d1c283d7ce151ed994e21f9a03e183b3f8d6eff86c5","last_reissued_at":"2026-05-18T03:55:47.674290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.674290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Mixed Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Geoffrey Gordon, Miroslav Dudik, Sue Ann Hong","submitted_at":"2012-05-09T15:25:08Z","abstract_excerpt":"Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations. First-order logic (FOL), on the other hand, excels at reasoning about classes of objects, but lacks a rich representation of uncertainty. While representing propositional logic in MILP has been extensively explored, no theory exists yet for fully combining FOL with MILP. We propose a new representation, called first-order programming or FOP, which subsumes both F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2644","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":"1205.2644","created_at":"2026-05-18T03:55:47.674444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2644v1","created_at":"2026-05-18T03:55:47.674444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2644","created_at":"2026-05-18T03:55:47.674444+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVHVOFRQOA6N","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVHVOFRQOA6NBXZA","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVHVOFRQ","created_at":"2026-05-18T12:27:20.899486+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/RVHVOFRQOA6NBXZAHUOCQPL44F","json":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F.json","graph_json":"https://pith.science/api/pith-number/RVHVOFRQOA6NBXZAHUOCQPL44F/graph.json","events_json":"https://pith.science/api/pith-number/RVHVOFRQOA6NBXZAHUOCQPL44F/events.json","paper":"https://pith.science/paper/RVHVOFRQ"},"agent_actions":{"view_html":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F","download_json":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F.json","view_paper":"https://pith.science/paper/RVHVOFRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2644&json=true","fetch_graph":"https://pith.science/api/pith-number/RVHVOFRQOA6NBXZAHUOCQPL44F/graph.json","fetch_events":"https://pith.science/api/pith-number/RVHVOFRQOA6NBXZAHUOCQPL44F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/action/storage_attestation","attest_author":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/action/author_attestation","sign_citation":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/action/citation_signature","submit_replication":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/action/replication_record"}},"created_at":"2026-05-18T03:55:47.674444+00:00","updated_at":"2026-05-18T03:55:47.674444+00:00"}