{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RVHVOFRQOA6NBXZAHUOCQPL44F","short_pith_number":"pith:RVHVOFRQ","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"},"canonical_sha256":"8d4f571630703cd0df203d1c283d7ce151ed994e21f9a03e183b3f8d6eff86c5","source":{"kind":"arxiv","id":"1205.2644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2644","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2644v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2644","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"RVHVOFRQOA6N","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RVHVOFRQOA6NBXZA","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RVHVOFRQ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RVHVOFRQOA6NBXZAHUOCQPL44F","target":"record","payload":{"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"},"canonical_sha256":"8d4f571630703cd0df203d1c283d7ce151ed994e21f9a03e183b3f8d6eff86c5","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"},"source_kind":"arxiv","source_id":"1205.2644","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXRaXR3bwrCGxOqNm/2xdN8fItwzClaZwGjmoZ3J+vbDWnbnIJ1FsNrNRXlyKJl5vuMg4tKzhLJt3z8PtdYiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:25:04.057883Z"},"content_sha256":"32a2cad145318311c70cebfdd74edeb67bc018347d485c6f3437634bdc730536","schema_version":"1.0","event_id":"sha256:32a2cad145318311c70cebfdd74edeb67bc018347d485c6f3437634bdc730536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RVHVOFRQOA6NBXZAHUOCQPL44F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qC7rC46vvnk9vPin1wGpjVDCxUcBR04dxVylA6TkzQMO/4ApJXSyiDC1Vvno3HW1IjpElJAYeWG8jY/5jPZxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:25:04.058636Z"},"content_sha256":"c71c00db7864192a92c765e18a4a884a6445431046ee6e6ceacd1f314500373e","schema_version":"1.0","event_id":"sha256:c71c00db7864192a92c765e18a4a884a6445431046ee6e6ceacd1f314500373e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/bundle.json","state_url":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T18:25:04Z","links":{"resolver":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F","bundle":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/bundle.json","state":"https://pith.science/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVHVOFRQOA6NBXZAHUOCQPL44F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RVHVOFRQOA6NBXZAHUOCQPL44F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b31e1399c1f7315c3a41b875221c161beb2779cedcc78927dea5ab46c1f96b05","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-09T15:25:08Z","title_canon_sha256":"24d2e04200301338252119f30c57c56b286433f66e442e4a673525d4a4642f8e"},"schema_version":"1.0","source":{"id":"1205.2644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2644","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2644v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2644","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"RVHVOFRQOA6N","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RVHVOFRQOA6NBXZA","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RVHVOFRQ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:c71c00db7864192a92c765e18a4a884a6445431046ee6e6ceacd1f314500373e","target":"graph","created_at":"2026-05-18T03:55:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Geoffrey Gordon, Miroslav Dudik, Sue Ann Hong","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-09T15:25:08Z","title":"First-Order Mixed Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2644","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:32a2cad145318311c70cebfdd74edeb67bc018347d485c6f3437634bdc730536","target":"record","created_at":"2026-05-18T03:55:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b31e1399c1f7315c3a41b875221c161beb2779cedcc78927dea5ab46c1f96b05","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-09T15:25:08Z","title_canon_sha256":"24d2e04200301338252119f30c57c56b286433f66e442e4a673525d4a4642f8e"},"schema_version":"1.0","source":{"id":"1205.2644","kind":"arxiv","version":1}},"canonical_sha256":"8d4f571630703cd0df203d1c283d7ce151ed994e21f9a03e183b3f8d6eff86c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d4f571630703cd0df203d1c283d7ce151ed994e21f9a03e183b3f8d6eff86c5","first_computed_at":"2026-05-18T03:55:47.674290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.674290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aLNiXGwq4j4d2zd+dJeVJut7NAzpcqSCcLnm5coYrW7mCZfSwv4pLZH0OlvlbslFS4xg8BNydotpCajOkgrrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.674962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32a2cad145318311c70cebfdd74edeb67bc018347d485c6f3437634bdc730536","sha256:c71c00db7864192a92c765e18a4a884a6445431046ee6e6ceacd1f314500373e"],"state_sha256":"81cef9b2a8ed844ae47a0e81ed23b2b856b0dc3575c892c7b86aeaa1e773c235"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjA0G0vpoZ7kMkEOQGIZBYxsTOzozk6s5IkHNOtpGjJlhrhVe6zCsxLFCHBbvIcP5f8r16x68g7nW/KIWYlTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:25:04.062417Z","bundle_sha256":"4bdcd4c86b5742665ac76de0dd6458270edb94220994fb395806ccc927cacc19"}}