{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AVUBIL4MP2PVYODKBOWTR4YMUG","short_pith_number":"pith:AVUBIL4M","canonical_record":{"source":{"id":"1806.07164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T11:37:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1d31001b524d4bd74e3c6e41cf28d30faad852ff8170bafdf4f9681097d9e54b","abstract_canon_sha256":"5c094f93ac37429a801497b01fa459eca4e30bcde30cc59c9eda7739a5c878e0"},"schema_version":"1.0"},"canonical_sha256":"0568142f8c7e9f5c386a0bad38f30ca1b6ed86f55ab808affe75a22bb6599763","source":{"kind":"arxiv","id":"1806.07164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07164","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07164v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07164","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"AVUBIL4MP2PV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AVUBIL4MP2PVYODK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AVUBIL4M","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AVUBIL4MP2PVYODKBOWTR4YMUG","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T11:37:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1d31001b524d4bd74e3c6e41cf28d30faad852ff8170bafdf4f9681097d9e54b","abstract_canon_sha256":"5c094f93ac37429a801497b01fa459eca4e30bcde30cc59c9eda7739a5c878e0"},"schema_version":"1.0"},"canonical_sha256":"0568142f8c7e9f5c386a0bad38f30ca1b6ed86f55ab808affe75a22bb6599763","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.691419Z","signature_b64":"GPqEb5dJEqeGcLa+n/P/ICw+jPXK+72F4leaVigCukEcLpuMCZXlzkcvaGh0JZdzBUYdIV8klkokYeN95Qi5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0568142f8c7e9f5c386a0bad38f30ca1b6ed86f55ab808affe75a22bb6599763","last_reissued_at":"2026-05-18T00:12:51.690973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.690973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07164","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:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUSkrc16nURxBANME6ibZPdvcTtWa/64CoTIQk9cY8ojPIRhj6a1SyDqA4UiGQ/r4Jw1+NK56zXi9hTcWyRTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:32:57.996582Z"},"content_sha256":"80d88530e65b607c9995152c9dbd2953e784c0c22b1262e75a65a0bcd636f8ca","schema_version":"1.0","event_id":"sha256:80d88530e65b607c9995152c9dbd2953e784c0c22b1262e75a65a0bcd636f8ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AVUBIL4MP2PVYODKBOWTR4YMUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Strategies for Incomplete MaxSAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Prateek Kumar, Ruben Martins, Saurabh Joshi, Sukrut Rao","submitted_at":"2018-06-19T11:37:50Z","abstract_excerpt":"Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarantees.\n  In this paper, we propose two approximation strategies for improving incomplete MaxSAT solving. In one of the strategies, we cluster the weights and approximate them with a representative weight. In another strategy, we break up the problem of minimizing the sum of weights of unsatisfiable clauses into multiple minimization subproblems. Experimental results show that approximation strategies can be used to find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07164","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:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnxovqsRNVs0p9lgawrNaIIuBjamTtqqFyFbp8mSewNfpwqSDgWXY/a6SPLA0ba59PtwUp/mqw0z5bGREe6XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:32:57.997241Z"},"content_sha256":"78410cb298073d9c731ffd1e0fb2fb520ef0dd7310e908cfb452d44c2fdb2fc7","schema_version":"1.0","event_id":"sha256:78410cb298073d9c731ffd1e0fb2fb520ef0dd7310e908cfb452d44c2fdb2fc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVUBIL4MP2PVYODKBOWTR4YMUG/bundle.json","state_url":"https://pith.science/pith/AVUBIL4MP2PVYODKBOWTR4YMUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVUBIL4MP2PVYODKBOWTR4YMUG/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-28T21:32:57Z","links":{"resolver":"https://pith.science/pith/AVUBIL4MP2PVYODKBOWTR4YMUG","bundle":"https://pith.science/pith/AVUBIL4MP2PVYODKBOWTR4YMUG/bundle.json","state":"https://pith.science/pith/AVUBIL4MP2PVYODKBOWTR4YMUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVUBIL4MP2PVYODKBOWTR4YMUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AVUBIL4MP2PVYODKBOWTR4YMUG","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":"5c094f93ac37429a801497b01fa459eca4e30bcde30cc59c9eda7739a5c878e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T11:37:50Z","title_canon_sha256":"1d31001b524d4bd74e3c6e41cf28d30faad852ff8170bafdf4f9681097d9e54b"},"schema_version":"1.0","source":{"id":"1806.07164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07164","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07164v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07164","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"AVUBIL4MP2PV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AVUBIL4MP2PVYODK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AVUBIL4M","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:78410cb298073d9c731ffd1e0fb2fb520ef0dd7310e908cfb452d44c2fdb2fc7","target":"graph","created_at":"2026-05-18T00:12:51Z","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":"Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarantees.\n  In this paper, we propose two approximation strategies for improving incomplete MaxSAT solving. In one of the strategies, we cluster the weights and approximate them with a representative weight. In another strategy, we break up the problem of minimizing the sum of weights of unsatisfiable clauses into multiple minimization subproblems. Experimental results show that approximation strategies can be used to find","authors_text":"Prateek Kumar, Ruben Martins, Saurabh Joshi, Sukrut Rao","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T11:37:50Z","title":"Approximation Strategies for Incomplete MaxSAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07164","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:80d88530e65b607c9995152c9dbd2953e784c0c22b1262e75a65a0bcd636f8ca","target":"record","created_at":"2026-05-18T00:12:51Z","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":"5c094f93ac37429a801497b01fa459eca4e30bcde30cc59c9eda7739a5c878e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T11:37:50Z","title_canon_sha256":"1d31001b524d4bd74e3c6e41cf28d30faad852ff8170bafdf4f9681097d9e54b"},"schema_version":"1.0","source":{"id":"1806.07164","kind":"arxiv","version":1}},"canonical_sha256":"0568142f8c7e9f5c386a0bad38f30ca1b6ed86f55ab808affe75a22bb6599763","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0568142f8c7e9f5c386a0bad38f30ca1b6ed86f55ab808affe75a22bb6599763","first_computed_at":"2026-05-18T00:12:51.690973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:51.690973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GPqEb5dJEqeGcLa+n/P/ICw+jPXK+72F4leaVigCukEcLpuMCZXlzkcvaGh0JZdzBUYdIV8klkokYeN95Qi5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:51.691419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80d88530e65b607c9995152c9dbd2953e784c0c22b1262e75a65a0bcd636f8ca","sha256:78410cb298073d9c731ffd1e0fb2fb520ef0dd7310e908cfb452d44c2fdb2fc7"],"state_sha256":"02fadf09bc760ef0c4a49a2083cef2c127621c34ab975ef00f6c327b615ec47e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6kUBDcsPVoE7lKpjao7A3selzVKpAaNLq1eBzxS/L8YWW8tK4fhtVmCwB8J0Y91IrzpZiZ7i/3wKcSsZJqJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:32:58.000830Z","bundle_sha256":"520124caa18de71adbea13cef48473eed419df5a59a4910448360e514b3156ba"}}