{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V6SVPU3KPQVDFL73MWKCZOIZ5T","short_pith_number":"pith:V6SVPU3K","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"},"canonical_sha256":"afa557d36a7c2a32affb65942cb919ecca5bc493b1f58b69bc9567ec02016d05","source":{"kind":"arxiv","id":"1702.02385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02385","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02385v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02385","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"V6SVPU3KPQVD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V6SVPU3KPQVDFL73","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V6SVPU3K","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V6SVPU3KPQVDFL73MWKCZOIZ5T","target":"record","payload":{"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"},"canonical_sha256":"afa557d36a7c2a32affb65942cb919ecca5bc493b1f58b69bc9567ec02016d05","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"},"source_kind":"arxiv","source_id":"1702.02385","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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFwQILowXj0KiJCfDrAvvlHrmoZdKH7LQxEIeBz4atxsk1IhLsBg96PGXaigUjcuB3Tj4rvBIHgL+S3k/FTrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:56:48.601350Z"},"content_sha256":"769cdfb06faaf185f0ce69d94fe5eba277af1a543b1d9798e9b6054719544beb","schema_version":"1.0","event_id":"sha256:769cdfb06faaf185f0ce69d94fe5eba277af1a543b1d9798e9b6054719544beb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V6SVPU3KPQVDFL73MWKCZOIZ5T","target":"graph","payload":{"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"},"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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHsfQGauTyzuDZTLep1NUWCEWKyggC1ZIovYAt6BIjvJU9u2q3Puxu7exBDTc/rxx9C32W/BbKXht/1k+INICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:56:48.601929Z"},"content_sha256":"cbb4f34848621bce346d641a110bcdfbfac2d6987fc3e7e20b5d832f5918c32f","schema_version":"1.0","event_id":"sha256:cbb4f34848621bce346d641a110bcdfbfac2d6987fc3e7e20b5d832f5918c32f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/bundle.json","state_url":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/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-06-06T00:56:48Z","links":{"resolver":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T","bundle":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/bundle.json","state":"https://pith.science/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6SVPU3KPQVDFL73MWKCZOIZ5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V6SVPU3KPQVDFL73MWKCZOIZ5T","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":"5e44fed94b42d9c39c23d74b69690ff5376aa4b8cfb3fdb34626b63b6722b26e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-08T11:52:15Z","title_canon_sha256":"4959e5959e18ef1d61e59651f4417e41fba4ae73218f18d796e9b13ea92a881a"},"schema_version":"1.0","source":{"id":"1702.02385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02385","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02385v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02385","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"V6SVPU3KPQVD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V6SVPU3KPQVDFL73","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V6SVPU3K","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:cbb4f34848621bce346d641a110bcdfbfac2d6987fc3e7e20b5d832f5918c32f","target":"graph","created_at":"2026-05-18T00:51:06Z","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":"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","authors_text":"Patrick Trentin, Roberto Sebastiani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-08T11:52:15Z","title":"On Optimization Modulo Theories, MaxSMT and Sorting Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02385","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:769cdfb06faaf185f0ce69d94fe5eba277af1a543b1d9798e9b6054719544beb","target":"record","created_at":"2026-05-18T00:51:06Z","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":"5e44fed94b42d9c39c23d74b69690ff5376aa4b8cfb3fdb34626b63b6722b26e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-08T11:52:15Z","title_canon_sha256":"4959e5959e18ef1d61e59651f4417e41fba4ae73218f18d796e9b13ea92a881a"},"schema_version":"1.0","source":{"id":"1702.02385","kind":"arxiv","version":1}},"canonical_sha256":"afa557d36a7c2a32affb65942cb919ecca5bc493b1f58b69bc9567ec02016d05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afa557d36a7c2a32affb65942cb919ecca5bc493b1f58b69bc9567ec02016d05","first_computed_at":"2026-05-18T00:51:06.052921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:06.052921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wm9agtdlJV9kB2t7myzrBWyStdSKX8Fm6rvtuJ8qs6v+Y0ktW3zn5Pu3J3NDZA+QaO/32tVhDFyZYRdJiVF+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:06.053331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:769cdfb06faaf185f0ce69d94fe5eba277af1a543b1d9798e9b6054719544beb","sha256:cbb4f34848621bce346d641a110bcdfbfac2d6987fc3e7e20b5d832f5918c32f"],"state_sha256":"dedea10add5af67f02fa02d05a28633d0f6fcee9c5755ec4155ac97dd5742933"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+yHUhHwYY1+kl+DfcV+GIQEODpv4y32CCjz4mO6Ec3FN8chBVvSjfcsj6yzSi/LPqSmTuKa7M28sx03brOWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:56:48.604944Z","bundle_sha256":"5eeac27ac77a2d85a3ce0b1ce7f545129917bca4ee7246d8e09f6cd503285a8b"}}