{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TOB5W3JZWCQKVXEX3PCIEQVQ7G","short_pith_number":"pith:TOB5W3JZ","canonical_record":{"source":{"id":"2009.00583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-01T17:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"7009639787a0a03deedd41d22b4c2a4cb5ecb2a5e37168ec4aa533f751d05d29","abstract_canon_sha256":"8f7116be5eff5369600b96aee7e248137b4289224293a0126de259c89f5f4c27"},"schema_version":"1.0"},"canonical_sha256":"9b83db6d39b0a0aadc97dbc48242b0f9849b2b6b5349810eb25c4604811acf99","source":{"kind":"arxiv","id":"2009.00583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.00583","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"2009.00583v1","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.00583","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"TOB5W3JZWCQK","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"pith_short_16","alias_value":"TOB5W3JZWCQKVXEX","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"pith_short_8","alias_value":"TOB5W3JZ","created_at":"2026-07-05T01:32:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TOB5W3JZWCQKVXEX3PCIEQVQ7G","target":"record","payload":{"canonical_record":{"source":{"id":"2009.00583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-01T17:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"7009639787a0a03deedd41d22b4c2a4cb5ecb2a5e37168ec4aa533f751d05d29","abstract_canon_sha256":"8f7116be5eff5369600b96aee7e248137b4289224293a0126de259c89f5f4c27"},"schema_version":"1.0"},"canonical_sha256":"9b83db6d39b0a0aadc97dbc48242b0f9849b2b6b5349810eb25c4604811acf99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:20.053763Z","signature_b64":"x9li1DsrpWO1gCLErNhc9Iehmc53s29HtICrQheONg8WMYdzOC4nSbUSjXHo9sEcYA+2YWZPypg+P/2MdRzIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b83db6d39b0a0aadc97dbc48242b0f9849b2b6b5349810eb25c4604811acf99","last_reissued_at":"2026-07-05T01:32:20.053321Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:20.053321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.00583","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:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXNf0yKifgZYR95LgmVEmSgmdKiAZQU8GEjLyNfQwI2xfklbJmQ17a9gkKm1S9rRto4qjh8Uh+1HWen6oUrZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:49:03.318642Z"},"content_sha256":"05abeb82980c87f695020bb4d6dad9d7f6fc5adf2976732858adc84766c27bc9","schema_version":"1.0","event_id":"sha256:05abeb82980c87f695020bb4d6dad9d7f6fc5adf2976732858adc84766c27bc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TOB5W3JZWCQKVXEX3PCIEQVQ7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formally Verified Transformation of Non-binary Constraints into Binary Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Catherine Dubois","submitted_at":"2020-09-01T17:15:06Z","abstract_excerpt":"It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of the most well-known translations is the Hidden Variable Encoding. In this paper we formalize this encoding in the proof assistant Coq and prove that any solution of the binary constraint satisfaction problem makes it possible to build a solution of the original problem and vice-versa. This formal development is used to complete the formally verified constraint solver developed in Coq by Carlier, Dubois and Go"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.00583","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/2009.00583/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:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXY5NmooM/VPy4fnUE3UUv39uzWoN64jPFQaS7KRt3szz5T3kv/mvTfGx62pyK5L3c+uc6T6bPVpq9NDWtGHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:49:03.319413Z"},"content_sha256":"30c6cbf70142411bddc6710d3d4f473c86de06ba2fd5710058439d6ff9221037","schema_version":"1.0","event_id":"sha256:30c6cbf70142411bddc6710d3d4f473c86de06ba2fd5710058439d6ff9221037"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G/bundle.json","state_url":"https://pith.science/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G/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-09T12:49:03Z","links":{"resolver":"https://pith.science/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G","bundle":"https://pith.science/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G/bundle.json","state":"https://pith.science/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOB5W3JZWCQKVXEX3PCIEQVQ7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TOB5W3JZWCQKVXEX3PCIEQVQ7G","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":"8f7116be5eff5369600b96aee7e248137b4289224293a0126de259c89f5f4c27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-01T17:15:06Z","title_canon_sha256":"7009639787a0a03deedd41d22b4c2a4cb5ecb2a5e37168ec4aa533f751d05d29"},"schema_version":"1.0","source":{"id":"2009.00583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.00583","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"2009.00583v1","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.00583","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"TOB5W3JZWCQK","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"pith_short_16","alias_value":"TOB5W3JZWCQKVXEX","created_at":"2026-07-05T01:32:20Z"},{"alias_kind":"pith_short_8","alias_value":"TOB5W3JZ","created_at":"2026-07-05T01:32:20Z"}],"graph_snapshots":[{"event_id":"sha256:30c6cbf70142411bddc6710d3d4f473c86de06ba2fd5710058439d6ff9221037","target":"graph","created_at":"2026-07-05T01:32:20Z","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/2009.00583/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of the most well-known translations is the Hidden Variable Encoding. In this paper we formalize this encoding in the proof assistant Coq and prove that any solution of the binary constraint satisfaction problem makes it possible to build a solution of the original problem and vice-versa. This formal development is used to complete the formally verified constraint solver developed in Coq by Carlier, Dubois and Go","authors_text":"Catherine Dubois","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-01T17:15:06Z","title":"Formally Verified Transformation of Non-binary Constraints into Binary Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.00583","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:05abeb82980c87f695020bb4d6dad9d7f6fc5adf2976732858adc84766c27bc9","target":"record","created_at":"2026-07-05T01:32:20Z","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":"8f7116be5eff5369600b96aee7e248137b4289224293a0126de259c89f5f4c27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-01T17:15:06Z","title_canon_sha256":"7009639787a0a03deedd41d22b4c2a4cb5ecb2a5e37168ec4aa533f751d05d29"},"schema_version":"1.0","source":{"id":"2009.00583","kind":"arxiv","version":1}},"canonical_sha256":"9b83db6d39b0a0aadc97dbc48242b0f9849b2b6b5349810eb25c4604811acf99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b83db6d39b0a0aadc97dbc48242b0f9849b2b6b5349810eb25c4604811acf99","first_computed_at":"2026-07-05T01:32:20.053321Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:32:20.053321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x9li1DsrpWO1gCLErNhc9Iehmc53s29HtICrQheONg8WMYdzOC4nSbUSjXHo9sEcYA+2YWZPypg+P/2MdRzIBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:32:20.053763Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.00583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05abeb82980c87f695020bb4d6dad9d7f6fc5adf2976732858adc84766c27bc9","sha256:30c6cbf70142411bddc6710d3d4f473c86de06ba2fd5710058439d6ff9221037"],"state_sha256":"3ce1564470f56ad238fba070bcf618562de8f1e6e18d21832379fb9a0bb5780e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RC7AO94pOX780jMg7CqkgGsc49+BaUIlPhoIPFyCnTfzagsZ2H0IfKga0r724zRQ22VP+uVgcSrRkWi08m/6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:49:03.328170Z","bundle_sha256":"5c8dde97ff974f1ab293f60ed50250cf5e707e055cd5560481cf8c5b2d263114"}}