{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WSAPKSEBOBJZZK4XSBKW6ESXCR","short_pith_number":"pith:WSAPKSEB","canonical_record":{"source":{"id":"1406.7196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-27T14:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"433d3ab58373d6106afca2d08e7b317c6102c3daedc75af2ad2950270bdfdcb9","abstract_canon_sha256":"22aa73ed0fbeea1452f386e97898dfe984e61dc61f02334611cde3ebdbefbcc9"},"schema_version":"1.0"},"canonical_sha256":"b480f5488170539cab9790556f12571443751a7a3601ebbc6bd71b63b2718efd","source":{"kind":"arxiv","id":"1406.7196","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7196","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7196v2","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7196","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"WSAPKSEBOBJZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WSAPKSEBOBJZZK4X","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WSAPKSEB","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WSAPKSEBOBJZZK4XSBKW6ESXCR","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-27T14:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"433d3ab58373d6106afca2d08e7b317c6102c3daedc75af2ad2950270bdfdcb9","abstract_canon_sha256":"22aa73ed0fbeea1452f386e97898dfe984e61dc61f02334611cde3ebdbefbcc9"},"schema_version":"1.0"},"canonical_sha256":"b480f5488170539cab9790556f12571443751a7a3601ebbc6bd71b63b2718efd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:45.698724Z","signature_b64":"opbMESBZAtOuRARvlWgmYlF1sv/zRspZEUZLe48xaEGLec/gbg1PvlKLAqc2OU9WjuEUo7TXPvUD/WG11udqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b480f5488170539cab9790556f12571443751a7a3601ebbc6bd71b63b2718efd","last_reissued_at":"2026-05-18T02:48:45.698221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:45.698221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7196","source_version":2,"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-18T02:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiDXAoqT/s/4jWAoBkFLgSnz0b7YjOtEx8tdOXUTFcRaqNURUlK75J9KEmcHJjN+ipjeReN8nJhsLUKBWK2LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:42:29.122765Z"},"content_sha256":"28139d92c598c9608a3d432ef61c0ff6b33d7c197178d05371cc6ef08eb04539","schema_version":"1.0","event_id":"sha256:28139d92c598c9608a3d432ef61c0ff6b33d7c197178d05371cc6ef08eb04539"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WSAPKSEBOBJZZK4XSBKW6ESXCR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Broderick Crawford, Eric Monfroy, Fr\\'ed\\'eric Lardeux, Ricardo Soto","submitted_at":"2014-06-27T14:37:12Z","abstract_excerpt":"On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to declaratively model set constraint problems and to encode them automatically into SAT instances. We apply our technique to the Social Golfer Problem and we also use it to break symmetries of the problem. Our technique is simpler, more declarative, and less error-prone than direct and improved hand modeling. The SAT instances that we automatically generate contain less clau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7196","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"},"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-18T02:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMqcoLIWT+WwcpwcVgUnnntQKwVvdIF+rVJiyLP/v7enirU6Zn9iAkB/WYbL6s/6T9+sKOBQlF12WZ+EhG4sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:42:29.123102Z"},"content_sha256":"0d9acc06fe931de03375caa799680067c000692997bf97cab1b61a7f85cfcd4a","schema_version":"1.0","event_id":"sha256:0d9acc06fe931de03375caa799680067c000692997bf97cab1b61a7f85cfcd4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR/bundle.json","state_url":"https://pith.science/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR/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-31T08:42:29Z","links":{"resolver":"https://pith.science/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR","bundle":"https://pith.science/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR/bundle.json","state":"https://pith.science/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSAPKSEBOBJZZK4XSBKW6ESXCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WSAPKSEBOBJZZK4XSBKW6ESXCR","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":"22aa73ed0fbeea1452f386e97898dfe984e61dc61f02334611cde3ebdbefbcc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-27T14:37:12Z","title_canon_sha256":"433d3ab58373d6106afca2d08e7b317c6102c3daedc75af2ad2950270bdfdcb9"},"schema_version":"1.0","source":{"id":"1406.7196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7196","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7196v2","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7196","created_at":"2026-05-18T02:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"WSAPKSEBOBJZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WSAPKSEBOBJZZK4X","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WSAPKSEB","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:0d9acc06fe931de03375caa799680067c000692997bf97cab1b61a7f85cfcd4a","target":"graph","created_at":"2026-05-18T02:48:45Z","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":"On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to declaratively model set constraint problems and to encode them automatically into SAT instances. We apply our technique to the Social Golfer Problem and we also use it to break symmetries of the problem. Our technique is simpler, more declarative, and less error-prone than direct and improved hand modeling. The SAT instances that we automatically generate contain less clau","authors_text":"Broderick Crawford, Eric Monfroy, Fr\\'ed\\'eric Lardeux, Ricardo Soto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-27T14:37:12Z","title":"Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7196","kind":"arxiv","version":2},"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:28139d92c598c9608a3d432ef61c0ff6b33d7c197178d05371cc6ef08eb04539","target":"record","created_at":"2026-05-18T02:48:45Z","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":"22aa73ed0fbeea1452f386e97898dfe984e61dc61f02334611cde3ebdbefbcc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-27T14:37:12Z","title_canon_sha256":"433d3ab58373d6106afca2d08e7b317c6102c3daedc75af2ad2950270bdfdcb9"},"schema_version":"1.0","source":{"id":"1406.7196","kind":"arxiv","version":2}},"canonical_sha256":"b480f5488170539cab9790556f12571443751a7a3601ebbc6bd71b63b2718efd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b480f5488170539cab9790556f12571443751a7a3601ebbc6bd71b63b2718efd","first_computed_at":"2026-05-18T02:48:45.698221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:45.698221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"opbMESBZAtOuRARvlWgmYlF1sv/zRspZEUZLe48xaEGLec/gbg1PvlKLAqc2OU9WjuEUo7TXPvUD/WG11udqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:45.698724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28139d92c598c9608a3d432ef61c0ff6b33d7c197178d05371cc6ef08eb04539","sha256:0d9acc06fe931de03375caa799680067c000692997bf97cab1b61a7f85cfcd4a"],"state_sha256":"f9891eb09fe456806d8b33b35f529b8d7490158d7e175add3adb3ebb5dd44acf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ewsjSWEih7dNBaqFxRMFTXOXVM3cxKopwZVUkAnBEp0hwCpzb06Dz6nijqPyMgd8a4HGWXeQDtDY6nvbOQbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:42:29.125498Z","bundle_sha256":"a6d92fa4ccd4e98e4df75ff67c13b52b2ca3873acdc4373358197bfb0518b992"}}