{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SUFDNBWFMQZQKASQQDWSKXSTND","short_pith_number":"pith:SUFDNBWF","canonical_record":{"source":{"id":"1408.4628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-20T12:44:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2cf8cb2cb4d4d22c3eee2a87ff4ed778b7fa08f46c0580906c78f61715c1276b","abstract_canon_sha256":"f13deab88d1d20b13c1793e13b3c44f24cf886c9677b600cda7d9a14cb3d67b6"},"schema_version":"1.0"},"canonical_sha256":"950a3686c5643305025080ed255e5368dbd2b3be9b4d93a61d41fcf7d7290667","source":{"kind":"arxiv","id":"1408.4628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4628","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4628v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4628","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"SUFDNBWFMQZQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SUFDNBWFMQZQKASQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SUFDNBWF","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SUFDNBWFMQZQKASQQDWSKXSTND","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-20T12:44:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2cf8cb2cb4d4d22c3eee2a87ff4ed778b7fa08f46c0580906c78f61715c1276b","abstract_canon_sha256":"f13deab88d1d20b13c1793e13b3c44f24cf886c9677b600cda7d9a14cb3d67b6"},"schema_version":"1.0"},"canonical_sha256":"950a3686c5643305025080ed255e5368dbd2b3be9b4d93a61d41fcf7d7290667","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:48.501274Z","signature_b64":"Xnnlk5fx5H6TVASwWrNB4HPSuFXcciSlgwtOyrsFS3r0DN8nDhY+0wXhFVUoLLuKThdCVrc/Ar2E6riLmsxxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"950a3686c5643305025080ed255e5368dbd2b3be9b4d93a61d41fcf7d7290667","last_reissued_at":"2026-05-18T02:44:48.500937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:48.500937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4628","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-18T02:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbharlPmBZ/blI1OjIaOB75uB8Btg3Qt0qruX9mdfeBuHpaMxhCKTNyBTaIn6UojR0yBhIqUkjpn6KVZAvZxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:46:59.433030Z"},"content_sha256":"ae8bb1dcd47a37d7376ec6697bed515e97b216b8fdd273e6cb560a4ed04052df","schema_version":"1.0","event_id":"sha256:ae8bb1dcd47a37d7376ec6697bed515e97b216b8fdd273e6cb560a4ed04052df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SUFDNBWFMQZQKASQQDWSKXSTND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Cardinality Constraints for MaxSAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Ines Lynce, Ruben Martins, Saurabh Joshi, Vasco Manquinho","submitted_at":"2014-08-20T12:44:49Z","abstract_excerpt":"Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental in nature, i.e. at each iteration the formula is rebuilt and no knowledge is reused from one iteration to another. In this paper, we exploit the knowledge acquired across iterations using novel schemes to use cardinality constraints in an incremental fashion. We integrate these schemes with several Ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4628","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-18T02:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybxFbk+H9r0IA6tlIMRQpq0OSmZ0+pxfBK0G1XP5VvqShMsZMw3sJpRl+MVSteHeFXQTNVuHgE4ClAimo4yMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:46:59.433386Z"},"content_sha256":"e7d399a523614a74c4bf6cb97bf50f6e2188ddc74dacc060ece9b95605fcfc9a","schema_version":"1.0","event_id":"sha256:e7d399a523614a74c4bf6cb97bf50f6e2188ddc74dacc060ece9b95605fcfc9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUFDNBWFMQZQKASQQDWSKXSTND/bundle.json","state_url":"https://pith.science/pith/SUFDNBWFMQZQKASQQDWSKXSTND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUFDNBWFMQZQKASQQDWSKXSTND/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-02T18:46:59Z","links":{"resolver":"https://pith.science/pith/SUFDNBWFMQZQKASQQDWSKXSTND","bundle":"https://pith.science/pith/SUFDNBWFMQZQKASQQDWSKXSTND/bundle.json","state":"https://pith.science/pith/SUFDNBWFMQZQKASQQDWSKXSTND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUFDNBWFMQZQKASQQDWSKXSTND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SUFDNBWFMQZQKASQQDWSKXSTND","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":"f13deab88d1d20b13c1793e13b3c44f24cf886c9677b600cda7d9a14cb3d67b6","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-20T12:44:49Z","title_canon_sha256":"2cf8cb2cb4d4d22c3eee2a87ff4ed778b7fa08f46c0580906c78f61715c1276b"},"schema_version":"1.0","source":{"id":"1408.4628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4628","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4628v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4628","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"SUFDNBWFMQZQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SUFDNBWFMQZQKASQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SUFDNBWF","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:e7d399a523614a74c4bf6cb97bf50f6e2188ddc74dacc060ece9b95605fcfc9a","target":"graph","created_at":"2026-05-18T02:44:48Z","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":"Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental in nature, i.e. at each iteration the formula is rebuilt and no knowledge is reused from one iteration to another. In this paper, we exploit the knowledge acquired across iterations using novel schemes to use cardinality constraints in an incremental fashion. We integrate these schemes with several Ma","authors_text":"Ines Lynce, Ruben Martins, Saurabh Joshi, Vasco Manquinho","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-20T12:44:49Z","title":"Incremental Cardinality Constraints for MaxSAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4628","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:ae8bb1dcd47a37d7376ec6697bed515e97b216b8fdd273e6cb560a4ed04052df","target":"record","created_at":"2026-05-18T02:44:48Z","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":"f13deab88d1d20b13c1793e13b3c44f24cf886c9677b600cda7d9a14cb3d67b6","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-20T12:44:49Z","title_canon_sha256":"2cf8cb2cb4d4d22c3eee2a87ff4ed778b7fa08f46c0580906c78f61715c1276b"},"schema_version":"1.0","source":{"id":"1408.4628","kind":"arxiv","version":1}},"canonical_sha256":"950a3686c5643305025080ed255e5368dbd2b3be9b4d93a61d41fcf7d7290667","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"950a3686c5643305025080ed255e5368dbd2b3be9b4d93a61d41fcf7d7290667","first_computed_at":"2026-05-18T02:44:48.500937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:48.500937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xnnlk5fx5H6TVASwWrNB4HPSuFXcciSlgwtOyrsFS3r0DN8nDhY+0wXhFVUoLLuKThdCVrc/Ar2E6riLmsxxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:48.501274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae8bb1dcd47a37d7376ec6697bed515e97b216b8fdd273e6cb560a4ed04052df","sha256:e7d399a523614a74c4bf6cb97bf50f6e2188ddc74dacc060ece9b95605fcfc9a"],"state_sha256":"ce93623fec230506e68916091f324821b2d5ae9f7bb306de5ac97fa31dad30f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NEAMFXM1AwUeACPwyYgu6a44avgGHLexM2Lxk4yMjylxomuW29gZfqSU6UTITfwa1SsNIHfHgFAnDFjPb5XDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:46:59.435234Z","bundle_sha256":"4cc97e9962ec7967556fa6f9e29f120e37023d34929771d3e7a4786a212f7879"}}