{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NENWEWTO4L2MDJ3W4QEXDXYUHR","short_pith_number":"pith:NENWEWTO","canonical_record":{"source":{"id":"2005.06274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2020-05-12T03:23:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"29083b74d49b6aabca05de9aee4c1f44a0c5d638d389fc2eca7ebe60af200751","abstract_canon_sha256":"c3283a636f3204af33bef71618e15a8208521a32274d167b61175ba53e2df162"},"schema_version":"1.0"},"canonical_sha256":"691b625a6ee2f4c1a776e40971df143c702099723e3ba25e45634976c077f516","source":{"kind":"arxiv","id":"2005.06274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.06274","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"2005.06274v1","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.06274","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"NENWEWTO4L2M","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"pith_short_16","alias_value":"NENWEWTO4L2MDJ3W","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"pith_short_8","alias_value":"NENWEWTO","created_at":"2026-07-05T01:02:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NENWEWTO4L2MDJ3W4QEXDXYUHR","target":"record","payload":{"canonical_record":{"source":{"id":"2005.06274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2020-05-12T03:23:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"29083b74d49b6aabca05de9aee4c1f44a0c5d638d389fc2eca7ebe60af200751","abstract_canon_sha256":"c3283a636f3204af33bef71618e15a8208521a32274d167b61175ba53e2df162"},"schema_version":"1.0"},"canonical_sha256":"691b625a6ee2f4c1a776e40971df143c702099723e3ba25e45634976c077f516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:33.860262Z","signature_b64":"mPJzBSqJzTLsLuILyREXRWWl4BQRluCOQsLxaCaO8gHKWFke2ar8d18iXg/GKAPCSMDtkGFsI0FXoFepNZW+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691b625a6ee2f4c1a776e40971df143c702099723e3ba25e45634976c077f516","last_reissued_at":"2026-07-05T01:02:33.859852Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:33.859852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.06274","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-07-05T01:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iy6klJ2hNIQSRiL0W1SPgBLyhpWbJj90HH0H9+JTchCIb9Xbh8zzkUdv6qyjs+VvziTqTex+93ipyy7WtLwMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:14:25.709557Z"},"content_sha256":"76858ce32d578c1185736983a8316e64e801d87cad6817b1d27988778682637c","schema_version":"1.0","event_id":"sha256:76858ce32d578c1185736983a8316e64e801d87cad6817b1d27988778682637c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NENWEWTO4L2MDJ3W4QEXDXYUHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Neng-Fa Zhou","submitted_at":"2020-05-12T03:23:00Z","abstract_excerpt":"The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have excluded the parallel-counter encoding, which is more compact that the binary-adder encoding, from consideration due to its incapability of enforcing arc consistency through unit propagation. This paper presents an experiment that shows astounding performance of the binary-adder encoding for the at-most-k constraint."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.06274","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.06274/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bqpn0fuAOkCv7oLKVbdp5TC92ZK6e1vj5HCcVGwNKgcOzeNfMQhzpG3iW+aIh1eqSlFIuWK1P93eMaRYWMSuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:14:25.710494Z"},"content_sha256":"300023a2dea0161730b2389d7f479b4442af795fb774b9e12f6b1654723dc998","schema_version":"1.0","event_id":"sha256:300023a2dea0161730b2389d7f479b4442af795fb774b9e12f6b1654723dc998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR/bundle.json","state_url":"https://pith.science/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR/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-08-21T22:14:25Z","links":{"resolver":"https://pith.science/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR","bundle":"https://pith.science/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR/bundle.json","state":"https://pith.science/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NENWEWTO4L2MDJ3W4QEXDXYUHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NENWEWTO4L2MDJ3W4QEXDXYUHR","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":"c3283a636f3204af33bef71618e15a8208521a32274d167b61175ba53e2df162","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2020-05-12T03:23:00Z","title_canon_sha256":"29083b74d49b6aabca05de9aee4c1f44a0c5d638d389fc2eca7ebe60af200751"},"schema_version":"1.0","source":{"id":"2005.06274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.06274","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"2005.06274v1","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.06274","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"NENWEWTO4L2M","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"pith_short_16","alias_value":"NENWEWTO4L2MDJ3W","created_at":"2026-07-05T01:02:33Z"},{"alias_kind":"pith_short_8","alias_value":"NENWEWTO","created_at":"2026-07-05T01:02:33Z"}],"graph_snapshots":[{"event_id":"sha256:300023a2dea0161730b2389d7f479b4442af795fb774b9e12f6b1654723dc998","target":"graph","created_at":"2026-07-05T01:02:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.06274/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have excluded the parallel-counter encoding, which is more compact that the binary-adder encoding, from consideration due to its incapability of enforcing arc consistency through unit propagation. This paper presents an experiment that shows astounding performance of the binary-adder encoding for the at-most-k constraint.","authors_text":"Neng-Fa Zhou","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2020-05-12T03:23:00Z","title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.06274","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:76858ce32d578c1185736983a8316e64e801d87cad6817b1d27988778682637c","target":"record","created_at":"2026-07-05T01:02:33Z","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":"c3283a636f3204af33bef71618e15a8208521a32274d167b61175ba53e2df162","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2020-05-12T03:23:00Z","title_canon_sha256":"29083b74d49b6aabca05de9aee4c1f44a0c5d638d389fc2eca7ebe60af200751"},"schema_version":"1.0","source":{"id":"2005.06274","kind":"arxiv","version":1}},"canonical_sha256":"691b625a6ee2f4c1a776e40971df143c702099723e3ba25e45634976c077f516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691b625a6ee2f4c1a776e40971df143c702099723e3ba25e45634976c077f516","first_computed_at":"2026-07-05T01:02:33.859852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:02:33.859852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mPJzBSqJzTLsLuILyREXRWWl4BQRluCOQsLxaCaO8gHKWFke2ar8d18iXg/GKAPCSMDtkGFsI0FXoFepNZW+Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:02:33.860262Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.06274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76858ce32d578c1185736983a8316e64e801d87cad6817b1d27988778682637c","sha256:300023a2dea0161730b2389d7f479b4442af795fb774b9e12f6b1654723dc998"],"state_sha256":"9767b38f948d2c397cb4a78919977d50e6f5491418523b784520fbe7e323ecfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgXRN5FfzxC2/tZMMAe3g2Nit4r2ZgRRpc2IQShb3GZijs8dyFzxuPReoaPaZ2wXfy+XYsCLQjGPKZssHlYqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T22:14:25.716919Z","bundle_sha256":"251ca0bc5c84a80723715d81a68f3f29e04e4d44d40120862b75cd8d9fe77947"}}