{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:22TNVOP5V32ACJUO3EDD2PE2UJ","short_pith_number":"pith:22TNVOP5","canonical_record":{"source":{"id":"1404.4502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-17T12:09:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1c4c26965ee091461cd61644fe1d20dac0c1d2ddbac672a292acf4396f335f22","abstract_canon_sha256":"bee8bdae28f0b546972b278384b94d8a0e08f37f6579b440db303dc29ce307ae"},"schema_version":"1.0"},"canonical_sha256":"d6a6dab9fdaef401268ed9063d3c9aa25af2ee2d4d7461313b67456445da443d","source":{"kind":"arxiv","id":"1404.4502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4502","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4502v2","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4502","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"22TNVOP5V32A","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"22TNVOP5V32ACJUO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"22TNVOP5","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:22TNVOP5V32ACJUO3EDD2PE2UJ","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-17T12:09:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1c4c26965ee091461cd61644fe1d20dac0c1d2ddbac672a292acf4396f335f22","abstract_canon_sha256":"bee8bdae28f0b546972b278384b94d8a0e08f37f6579b440db303dc29ce307ae"},"schema_version":"1.0"},"canonical_sha256":"d6a6dab9fdaef401268ed9063d3c9aa25af2ee2d4d7461313b67456445da443d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.533780Z","signature_b64":"QlfThPlbX25EO2tLKgx75IrKbPWHN8EcRFMr9ricveSbdjKsnf137KjNt5tHN5nhvQN0p42XsOmw3kXeN4//DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a6dab9fdaef401268ed9063d3c9aa25af2ee2d4d7461313b67456445da443d","last_reissued_at":"2026-05-18T02:52:57.533115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.533115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4502","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jD0H4tYkiYq4y/O2G6/fT+MwS7T9s+NQTH+4wF+UsceNpk4roKLzc6aDB0gEYaAGT1j0xA+L5HUs5GIiT3VvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:40:39.344334Z"},"content_sha256":"3c1b3ac3e3d60fdc5d22b500b623c3e98a2dc8f672ffc7b9a0e47ad74decf562","schema_version":"1.0","event_id":"sha256:3c1b3ac3e3d60fdc5d22b500b623c3e98a2dc8f672ffc7b9a0e47ad74decf562"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:22TNVOP5V32ACJUO3EDD2PE2UJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Complete Solver for Constraint Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Arnaud Lallouet, Thi-Van-Anh Nguyen","submitted_at":"2014-04-17T12:09:51Z","abstract_excerpt":"Game Theory studies situations in which multiple agents having conflicting objectives have to reach a collective decision. The question of a compact representation language for agents utility function is of crucial importance since the classical representation of a $n$-players game is given by a $n$-dimensional matrix of exponential size for each player. In this paper we use the framework of Constraint Games in which CSP are used to represent utilities. Constraint Programming --including global constraints-- allows to easily give a compact and elegant model to many useful games. Constraint Gam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4502","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7ypjlFeeE/wxjkKyDBTTpxNWIKx0TwIKmyEbceKsyYIiEoFkw/FdsA1MvoPbEwmYKYjJMTqKbye+HErNkEeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:40:39.344680Z"},"content_sha256":"78e10be42fc495cbd129748ef58c687027320d1ab0bd0600319a528bd0ce72ba","schema_version":"1.0","event_id":"sha256:78e10be42fc495cbd129748ef58c687027320d1ab0bd0600319a528bd0ce72ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22TNVOP5V32ACJUO3EDD2PE2UJ/bundle.json","state_url":"https://pith.science/pith/22TNVOP5V32ACJUO3EDD2PE2UJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22TNVOP5V32ACJUO3EDD2PE2UJ/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-26T09:40:39Z","links":{"resolver":"https://pith.science/pith/22TNVOP5V32ACJUO3EDD2PE2UJ","bundle":"https://pith.science/pith/22TNVOP5V32ACJUO3EDD2PE2UJ/bundle.json","state":"https://pith.science/pith/22TNVOP5V32ACJUO3EDD2PE2UJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22TNVOP5V32ACJUO3EDD2PE2UJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:22TNVOP5V32ACJUO3EDD2PE2UJ","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":"bee8bdae28f0b546972b278384b94d8a0e08f37f6579b440db303dc29ce307ae","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-17T12:09:51Z","title_canon_sha256":"1c4c26965ee091461cd61644fe1d20dac0c1d2ddbac672a292acf4396f335f22"},"schema_version":"1.0","source":{"id":"1404.4502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4502","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4502v2","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4502","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"22TNVOP5V32A","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"22TNVOP5V32ACJUO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"22TNVOP5","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:78e10be42fc495cbd129748ef58c687027320d1ab0bd0600319a528bd0ce72ba","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"Game Theory studies situations in which multiple agents having conflicting objectives have to reach a collective decision. The question of a compact representation language for agents utility function is of crucial importance since the classical representation of a $n$-players game is given by a $n$-dimensional matrix of exponential size for each player. In this paper we use the framework of Constraint Games in which CSP are used to represent utilities. Constraint Programming --including global constraints-- allows to easily give a compact and elegant model to many useful games. Constraint Gam","authors_text":"Arnaud Lallouet, Thi-Van-Anh Nguyen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-17T12:09:51Z","title":"A Complete Solver for Constraint Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4502","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:3c1b3ac3e3d60fdc5d22b500b623c3e98a2dc8f672ffc7b9a0e47ad74decf562","target":"record","created_at":"2026-05-18T02:52:57Z","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":"bee8bdae28f0b546972b278384b94d8a0e08f37f6579b440db303dc29ce307ae","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-17T12:09:51Z","title_canon_sha256":"1c4c26965ee091461cd61644fe1d20dac0c1d2ddbac672a292acf4396f335f22"},"schema_version":"1.0","source":{"id":"1404.4502","kind":"arxiv","version":2}},"canonical_sha256":"d6a6dab9fdaef401268ed9063d3c9aa25af2ee2d4d7461313b67456445da443d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6a6dab9fdaef401268ed9063d3c9aa25af2ee2d4d7461313b67456445da443d","first_computed_at":"2026-05-18T02:52:57.533115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.533115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QlfThPlbX25EO2tLKgx75IrKbPWHN8EcRFMr9ricveSbdjKsnf137KjNt5tHN5nhvQN0p42XsOmw3kXeN4//DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.533780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c1b3ac3e3d60fdc5d22b500b623c3e98a2dc8f672ffc7b9a0e47ad74decf562","sha256:78e10be42fc495cbd129748ef58c687027320d1ab0bd0600319a528bd0ce72ba"],"state_sha256":"60e96d91e5aadaa09dfa451cd7e93dba38d5e6cda2880d89779920ae39ccb317"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYmm67BKqxzEQVctcW80+nr5dFK1xY2vivaghiuxisgUBb2D9d/3IRa7Cgn/l7QcrHL3V44Bc5Zout0ZSfVhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:40:39.346557Z","bundle_sha256":"7aa4bd1890901f64063ce80196a7550cbea779f37c18edf58e484d9edba437b5"}}