{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:25EWGPEX6O67TEGWZWFFTYGSOU","short_pith_number":"pith:25EWGPEX","canonical_record":{"source":{"id":"1810.12975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-27T16:16:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d55bdaac8ffc92ccd12fd48bb2597e8fe1ab2a3337dd2630e9ffd5c8c272ef7c","abstract_canon_sha256":"bfb28283807e5965fedbf559eea25d7d0ede0ffb76b0930c17feeded15e486e4"},"schema_version":"1.0"},"canonical_sha256":"d749633c97f3bdf990d6cd8a59e0d27507fbfb6cdc25021853acb744b7514e4c","source":{"kind":"arxiv","id":"1810.12975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12975v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"25EWGPEX6O67","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25EWGPEX6O67TEGW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25EWGPEX","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:25EWGPEX6O67TEGWZWFFTYGSOU","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-27T16:16:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d55bdaac8ffc92ccd12fd48bb2597e8fe1ab2a3337dd2630e9ffd5c8c272ef7c","abstract_canon_sha256":"bfb28283807e5965fedbf559eea25d7d0ede0ffb76b0930c17feeded15e486e4"},"schema_version":"1.0"},"canonical_sha256":"d749633c97f3bdf990d6cd8a59e0d27507fbfb6cdc25021853acb744b7514e4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.570451Z","signature_b64":"emNDo5O6o0sQwtxMA0BUI/QjZRg0uOfFXFtc3/DBbvuiWiM9PxEdaQITEcIiuu4h2ORmi9WAbvMqh9ChezakBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d749633c97f3bdf990d6cd8a59e0d27507fbfb6cdc25021853acb744b7514e4c","last_reissued_at":"2026-05-18T00:01:52.570008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.570008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12975","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:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sk5UA0Cnj5F6k2W1fKNxpzGLH2WGAscZVYGm5OCTGANh6pdGEzag4Zb1PpiwXt5eUe6Oju0YxSETz6NcDPjVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:56:53.231215Z"},"content_sha256":"c23bfa1039e16c5ece3db2aa452eef3af20f4330c54ffdc4b2dbc05769d1f23b","schema_version":"1.0","event_id":"sha256:c23bfa1039e16c5ece3db2aa452eef3af20f4330c54ffdc4b2dbc05769d1f23b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:25EWGPEX6O67TEGWZWFFTYGSOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A comparison of encodings for cardinality constraints in a SAT solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Ed Wynn","submitted_at":"2018-10-27T16:16:59Z","abstract_excerpt":"Cardinality constraints are important in many Sat problems; previous studies provide contradictory conclusions about the best encoding to use. Here, three encodings are compared: Sinz's sequential-counter, Bailleux and Boufkhad's tree-based, and Ab\\'{\\i}o and coworkers' sort-based approaches. The sequential-counter approach is found to be the fastest of these for a range of related, combinatorial test cases. All encodings permit multiple solutions in the auxiliary variables for a single solution to the main variables; the numbers of multiple solutions can be very large, and might impede a Sat "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12975","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:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/kg55T0q/gpUHBLdOMusk463Qz877yWH2we3vZu63jmq6wQMROUvdWH6PzqXYZOQmI4mhZ/M4JEkN7IKhw7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:56:53.231580Z"},"content_sha256":"83e462e72bcdc1ae6b02309b97b818ab5ca240eb66c71d29b9b51f81712966ba","schema_version":"1.0","event_id":"sha256:83e462e72bcdc1ae6b02309b97b818ab5ca240eb66c71d29b9b51f81712966ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25EWGPEX6O67TEGWZWFFTYGSOU/bundle.json","state_url":"https://pith.science/pith/25EWGPEX6O67TEGWZWFFTYGSOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25EWGPEX6O67TEGWZWFFTYGSOU/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-04T17:56:53Z","links":{"resolver":"https://pith.science/pith/25EWGPEX6O67TEGWZWFFTYGSOU","bundle":"https://pith.science/pith/25EWGPEX6O67TEGWZWFFTYGSOU/bundle.json","state":"https://pith.science/pith/25EWGPEX6O67TEGWZWFFTYGSOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25EWGPEX6O67TEGWZWFFTYGSOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:25EWGPEX6O67TEGWZWFFTYGSOU","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":"bfb28283807e5965fedbf559eea25d7d0ede0ffb76b0930c17feeded15e486e4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-27T16:16:59Z","title_canon_sha256":"d55bdaac8ffc92ccd12fd48bb2597e8fe1ab2a3337dd2630e9ffd5c8c272ef7c"},"schema_version":"1.0","source":{"id":"1810.12975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12975v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"25EWGPEX6O67","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25EWGPEX6O67TEGW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25EWGPEX","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:83e462e72bcdc1ae6b02309b97b818ab5ca240eb66c71d29b9b51f81712966ba","target":"graph","created_at":"2026-05-18T00:01:52Z","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":"Cardinality constraints are important in many Sat problems; previous studies provide contradictory conclusions about the best encoding to use. Here, three encodings are compared: Sinz's sequential-counter, Bailleux and Boufkhad's tree-based, and Ab\\'{\\i}o and coworkers' sort-based approaches. The sequential-counter approach is found to be the fastest of these for a range of related, combinatorial test cases. All encodings permit multiple solutions in the auxiliary variables for a single solution to the main variables; the numbers of multiple solutions can be very large, and might impede a Sat ","authors_text":"Ed Wynn","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-27T16:16:59Z","title":"A comparison of encodings for cardinality constraints in a SAT solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12975","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:c23bfa1039e16c5ece3db2aa452eef3af20f4330c54ffdc4b2dbc05769d1f23b","target":"record","created_at":"2026-05-18T00:01:52Z","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":"bfb28283807e5965fedbf559eea25d7d0ede0ffb76b0930c17feeded15e486e4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-27T16:16:59Z","title_canon_sha256":"d55bdaac8ffc92ccd12fd48bb2597e8fe1ab2a3337dd2630e9ffd5c8c272ef7c"},"schema_version":"1.0","source":{"id":"1810.12975","kind":"arxiv","version":1}},"canonical_sha256":"d749633c97f3bdf990d6cd8a59e0d27507fbfb6cdc25021853acb744b7514e4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d749633c97f3bdf990d6cd8a59e0d27507fbfb6cdc25021853acb744b7514e4c","first_computed_at":"2026-05-18T00:01:52.570008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.570008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"emNDo5O6o0sQwtxMA0BUI/QjZRg0uOfFXFtc3/DBbvuiWiM9PxEdaQITEcIiuu4h2ORmi9WAbvMqh9ChezakBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.570451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c23bfa1039e16c5ece3db2aa452eef3af20f4330c54ffdc4b2dbc05769d1f23b","sha256:83e462e72bcdc1ae6b02309b97b818ab5ca240eb66c71d29b9b51f81712966ba"],"state_sha256":"31f30177a046c3b0a4cbc8b58c20bcfd36961b9a7bc3cee49841caa23517ae48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEIwYe8WG5fpB35MsHdMhz36UEnpubSUq3mfCP6Ey3gSYFkvr1JyC30UeXb5yPr+nq6GMn9w3EdwIpjO4YuRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:56:53.233719Z","bundle_sha256":"9cdf8d875f05c5570ef568660cc4df1e307bf58d2944f0e6e3031f1bfc6ab93b"}}