{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MH6TTUZNFMNLBZ5KC2ETRTFRXC","short_pith_number":"pith:MH6TTUZN","schema_version":"1.0","canonical_sha256":"61fd39d32d2b1ab0e7aa168938ccb1b8bc2961d172e7cb4e9dcd21387661e0c3","source":{"kind":"arxiv","id":"1310.2298","version":2},"attestation_state":"computed","paper":{"title":"SAT-based Preprocessing for MaxSAT (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anton Belov, Antonio Morgado, Joao Marques-Silva","submitted_at":"2013-10-08T22:33:38Z","abstract_excerpt":"State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. Additionally, satisfiability-preserving clause elimination procedures are often used. Since MaxSAT computation typically involves a large number of SAT calls, we are interested in whether an input instance to a MaxSAT problem can be preprocessed up-front, i.e. prior to running the MaxSAT solver, rather than (or, in addit"},"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":"1310.2298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-08T22:33:38Z","cross_cats_sorted":[],"title_canon_sha256":"59e2ca5235e12967ba8835beef740a464242ebc5c14bba4e601fc6ff083481d8","abstract_canon_sha256":"040ec446f0fde511a25ee84df4cfaf3b32558b9b3954ee25bfd44a329d85e440"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:23.754555Z","signature_b64":"7IK1vO0L4KWSgZfvqIxdyjHCXV1MKhtaVOGV2tQGqAErhFO9UwJUF7TtgExJ9eesKhs3lxap6CA4Z26lu02kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61fd39d32d2b1ab0e7aa168938ccb1b8bc2961d172e7cb4e9dcd21387661e0c3","last_reissued_at":"2026-05-18T03:10:23.754006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:23.754006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAT-based Preprocessing for MaxSAT (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anton Belov, Antonio Morgado, Joao Marques-Silva","submitted_at":"2013-10-08T22:33:38Z","abstract_excerpt":"State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. Additionally, satisfiability-preserving clause elimination procedures are often used. Since MaxSAT computation typically involves a large number of SAT calls, we are interested in whether an input instance to a MaxSAT problem can be preprocessed up-front, i.e. prior to running the MaxSAT solver, rather than (or, in addit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2298","kind":"arxiv","version":2},"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":"1310.2298","created_at":"2026-05-18T03:10:23.754076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2298v2","created_at":"2026-05-18T03:10:23.754076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2298","created_at":"2026-05-18T03:10:23.754076+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH6TTUZNFMNL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH6TTUZNFMNLBZ5K","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH6TTUZN","created_at":"2026-05-18T12:27:52.871228+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/MH6TTUZNFMNLBZ5KC2ETRTFRXC","json":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC.json","graph_json":"https://pith.science/api/pith-number/MH6TTUZNFMNLBZ5KC2ETRTFRXC/graph.json","events_json":"https://pith.science/api/pith-number/MH6TTUZNFMNLBZ5KC2ETRTFRXC/events.json","paper":"https://pith.science/paper/MH6TTUZN"},"agent_actions":{"view_html":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC","download_json":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC.json","view_paper":"https://pith.science/paper/MH6TTUZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2298&json=true","fetch_graph":"https://pith.science/api/pith-number/MH6TTUZNFMNLBZ5KC2ETRTFRXC/graph.json","fetch_events":"https://pith.science/api/pith-number/MH6TTUZNFMNLBZ5KC2ETRTFRXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC/action/storage_attestation","attest_author":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC/action/author_attestation","sign_citation":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC/action/citation_signature","submit_replication":"https://pith.science/pith/MH6TTUZNFMNLBZ5KC2ETRTFRXC/action/replication_record"}},"created_at":"2026-05-18T03:10:23.754076+00:00","updated_at":"2026-05-18T03:10:23.754076+00:00"}