{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KR6GFR2DQZ3UMSXVHFHJDQW2QS","short_pith_number":"pith:KR6GFR2D","canonical_record":{"source":{"id":"1111.0040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T21:39:39Z","cross_cats_sorted":[],"title_canon_sha256":"7652425f2dcfab413c46d2ad6d52bea9d80f679cb3f09b7dc83f557a99a3862a","abstract_canon_sha256":"79b6119848551fdb7630746e553453b6a1d3914b0cef6e6f80f1d20008e4a460"},"schema_version":"1.0"},"canonical_sha256":"547c62c7438677464af5394e91c2da848f5555a8731d302099c2d4e7e2d7028f","source":{"kind":"arxiv","id":"1111.0040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0040","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0040v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0040","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"KR6GFR2DQZ3U","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KR6GFR2DQZ3UMSXV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KR6GFR2D","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KR6GFR2DQZ3UMSXVHFHJDQW2QS","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T21:39:39Z","cross_cats_sorted":[],"title_canon_sha256":"7652425f2dcfab413c46d2ad6d52bea9d80f679cb3f09b7dc83f557a99a3862a","abstract_canon_sha256":"79b6119848551fdb7630746e553453b6a1d3914b0cef6e6f80f1d20008e4a460"},"schema_version":"1.0"},"canonical_sha256":"547c62c7438677464af5394e91c2da848f5555a8731d302099c2d4e7e2d7028f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.621275Z","signature_b64":"E93H9rkvYal9zB+v4MqIatGIELYTdCEbK72JFQMLJ/r02laZDE/DT7+wj7zgz3T/MLFUNhz+nt0TLcvRuzirCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"547c62c7438677464af5394e91c2da848f5555a8731d302099c2d4e7e2d7028f","last_reissued_at":"2026-05-18T04:09:46.620846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.620846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0040","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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hvhk8WnnHcuJ0lFglB2p7z0IBz3olkSwbYdCZ5cozUyaG3HqIEQInzhM2U2tlI8zRR1DervjiOriHoXW4wbrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:32:16.726225Z"},"content_sha256":"fb51570f23e5310c149575e69da9755d350a25a87ed5ee55cb4e9dd5f7e3e69a","schema_version":"1.0","event_id":"sha256:fb51570f23e5310c149575e69da9755d350a25a87ed5ee55cb4e9dd5f7e3e69a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KR6GFR2DQZ3UMSXVHFHJDQW2QS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Inference Rules for Max-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"C. M. Li, F. Manya, J. Planes","submitted_at":"2011-10-31T21:39:39Z","abstract_excerpt":"Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the Max-SAT problem for the simplified formula is not equivalent to solving it for the original formula. In this paper, we define a number of original inference rules that, besides being applied efficiently, transform Max-SAT instances into equivalent Max-SAT instances which are easier to solve. The soundness of the rules, that can be seen as refinem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0040","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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MudnmMFg9iZyG2ZrIq+WUKD80EE7NpbSA2W2wbf8oWpxac0QtwSAdt4O1XnZhrNJk42a5lVUZWZQiKRvB3jyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:32:16.726599Z"},"content_sha256":"beef717ecc4887ba86ee26d6b16c1881e3c7ee5a3c6a9f005162667646c6794a","schema_version":"1.0","event_id":"sha256:beef717ecc4887ba86ee26d6b16c1881e3c7ee5a3c6a9f005162667646c6794a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS/bundle.json","state_url":"https://pith.science/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS/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-12T00:32:16Z","links":{"resolver":"https://pith.science/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS","bundle":"https://pith.science/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS/bundle.json","state":"https://pith.science/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KR6GFR2DQZ3UMSXVHFHJDQW2QS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KR6GFR2DQZ3UMSXVHFHJDQW2QS","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":"79b6119848551fdb7630746e553453b6a1d3914b0cef6e6f80f1d20008e4a460","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T21:39:39Z","title_canon_sha256":"7652425f2dcfab413c46d2ad6d52bea9d80f679cb3f09b7dc83f557a99a3862a"},"schema_version":"1.0","source":{"id":"1111.0040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0040","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0040v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0040","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"KR6GFR2DQZ3U","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KR6GFR2DQZ3UMSXV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KR6GFR2D","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:beef717ecc4887ba86ee26d6b16c1881e3c7ee5a3c6a9f005162667646c6794a","target":"graph","created_at":"2026-05-18T04:09:46Z","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":"Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the Max-SAT problem for the simplified formula is not equivalent to solving it for the original formula. In this paper, we define a number of original inference rules that, besides being applied efficiently, transform Max-SAT instances into equivalent Max-SAT instances which are easier to solve. The soundness of the rules, that can be seen as refinem","authors_text":"C. M. Li, F. Manya, J. Planes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T21:39:39Z","title":"New Inference Rules for Max-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0040","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:fb51570f23e5310c149575e69da9755d350a25a87ed5ee55cb4e9dd5f7e3e69a","target":"record","created_at":"2026-05-18T04:09:46Z","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":"79b6119848551fdb7630746e553453b6a1d3914b0cef6e6f80f1d20008e4a460","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T21:39:39Z","title_canon_sha256":"7652425f2dcfab413c46d2ad6d52bea9d80f679cb3f09b7dc83f557a99a3862a"},"schema_version":"1.0","source":{"id":"1111.0040","kind":"arxiv","version":1}},"canonical_sha256":"547c62c7438677464af5394e91c2da848f5555a8731d302099c2d4e7e2d7028f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"547c62c7438677464af5394e91c2da848f5555a8731d302099c2d4e7e2d7028f","first_computed_at":"2026-05-18T04:09:46.620846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:46.620846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E93H9rkvYal9zB+v4MqIatGIELYTdCEbK72JFQMLJ/r02laZDE/DT7+wj7zgz3T/MLFUNhz+nt0TLcvRuzirCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:46.621275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb51570f23e5310c149575e69da9755d350a25a87ed5ee55cb4e9dd5f7e3e69a","sha256:beef717ecc4887ba86ee26d6b16c1881e3c7ee5a3c6a9f005162667646c6794a"],"state_sha256":"68847da61abc7618af15576085c96cdb83bd42c7824ef1f5907694d2ed3db34b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkGdbf3ig4UmkpAgss2rqt2KbfrlxbwvyA559PlV+zreta7/uaMd52xpNkXlgnxY/KUCmKyph+3Wy5/UXBC3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:32:16.728600Z","bundle_sha256":"d87a2a5c9ac8e10f7c739d082cf4074e1c8a8b21179d2a6c65463c5590bb726b"}}