{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V6SVPU3KPQVDFL73MWKCZOIZ5T","short_pith_number":"pith:V6SVPU3K","schema_version":"1.0","canonical_sha256":"afa557d36a7c2a32affb65942cb919ecca5bc493b1f58b69bc9567ec02016d05","source":{"kind":"arxiv","id":"1702.02385","version":1},"attestation_state":"computed","paper":{"title":"On Optimization Modulo Theories, MaxSMT and Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Patrick Trentin, Roberto Sebastiani","submitted_at":"2017-02-08T11:52:15Z","abstract_excerpt":"Optimization Modulo Theories (OMT) is an extension of SMT which allows for finding models that optimize given objectives. (Partial weighted) MaxSMT --or equivalently OMT with Pseudo-Boolean objective functions, OMT+PB-- is a very-relevant strict subcase of OMT. We classify existing approaches for MaxSMT or OMT+PB in two groups: MaxSAT-based approaches exploit the efficiency of state-of-the-art MAXSAT solvers, but they are specific-purpose and not always applicable; OMT-based approaches are general-purpose, but they suffer from intrinsic inefficiencies on MaxSMT/OMT+PB problems.\n  We identify a"},"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":"1702.02385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-08T11:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"4959e5959e18ef1d61e59651f4417e41fba4ae73218f18d796e9b13ea92a881a","abstract_canon_sha256":"5e44fed94b42d9c39c23d74b69690ff5376aa4b8cfb3fdb34626b63b6722b26e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.053331Z","signature_b64":"wm9agtdlJV9kB2t7myzrBWyStdSKX8Fm6rvtuJ8qs6v+Y0ktW3zn5Pu3J3NDZA+QaO/32tVhDFyZYRdJiVF+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afa557d36a7c2a32affb65942cb919ecca5bc493b1f58b69bc9567ec02016d05","last_reissued_at":"2026-05-18T00:51:06.052921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.052921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimization Modulo Theories, MaxSMT and Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Patrick Trentin, Roberto Sebastiani","submitted_at":"2017-02-08T11:52:15Z","abstract_excerpt":"Optimization Modulo Theories (OMT) is an extension of SMT which allows for finding models that optimize given objectives. (Partial weighted) MaxSMT --or equivalently OMT with Pseudo-Boolean objective functions, OMT+PB-- is a very-relevant strict subcase of OMT. We classify existing approaches for MaxSMT or OMT+PB in two groups: MaxSAT-based approaches exploit the efficiency of state-of-the-art MAXSAT solvers, but they are specific-purpose and not always applicable; OMT-based approaches are general-purpose, but they suffer from intrinsic inefficiencies on MaxSMT/OMT+PB problems.\n  We identify a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02385","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":"1702.02385","created_at":"2026-05-18T00:51:06.052982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02385v1","created_at":"2026-05-18T00:51:06.052982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02385","created_at":"2026-05-18T00:51:06.052982+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6SVPU3KPQVD","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6SVPU3KPQVDFL73","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6SVPU3K","created_at":"2026-05-18T12:31:49.984773+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/V6SVPU3KPQVDFL73MWKCZOIZ5T","json":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T.json","graph_json":"https://pith.science/api/pith-number/V6SVPU3KPQVDFL73MWKCZOIZ5T/graph.json","events_json":"https://pith.science/api/pith-number/V6SVPU3KPQVDFL73MWKCZOIZ5T/events.json","paper":"https://pith.science/paper/V6SVPU3K"},"agent_actions":{"view_html":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T","download_json":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T.json","view_paper":"https://pith.science/paper/V6SVPU3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02385&json=true","fetch_graph":"https://pith.science/api/pith-number/V6SVPU3KPQVDFL73MWKCZOIZ5T/graph.json","fetch_events":"https://pith.science/api/pith-number/V6SVPU3KPQVDFL73MWKCZOIZ5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/action/storage_attestation","attest_author":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/action/author_attestation","sign_citation":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/action/citation_signature","submit_replication":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/action/replication_record"}},"created_at":"2026-05-18T00:51:06.052982+00:00","updated_at":"2026-05-18T00:51:06.052982+00:00"}