{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EHMJDV5YT43ZVXRSD7B4PKD7C4","short_pith_number":"pith:EHMJDV5Y","canonical_record":{"source":{"id":"1112.6096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-12-28T10:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"56682f92ae3afab9aa80843e8b5800ca5ebd5c064a9cefa6d75e2193276fc982","abstract_canon_sha256":"78c5ba83569b09a702be0d7581a132551d18eabc5192ec25bb3e9aca77834f78"},"schema_version":"1.0"},"canonical_sha256":"21d891d7b89f379ade321fc3c7a87f1719d15a8e636a73e58bdf09fa68b4639f","source":{"kind":"arxiv","id":"1112.6096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6096","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6096v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6096","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"EHMJDV5YT43Z","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EHMJDV5YT43ZVXRS","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EHMJDV5Y","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EHMJDV5YT43ZVXRSD7B4PKD7C4","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-12-28T10:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"56682f92ae3afab9aa80843e8b5800ca5ebd5c064a9cefa6d75e2193276fc982","abstract_canon_sha256":"78c5ba83569b09a702be0d7581a132551d18eabc5192ec25bb3e9aca77834f78"},"schema_version":"1.0"},"canonical_sha256":"21d891d7b89f379ade321fc3c7a87f1719d15a8e636a73e58bdf09fa68b4639f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:36.820912Z","signature_b64":"5ZQAys5CqaMBDWQmtKjznQadu27fnhwGiusxzaYdLCIqJrea4qZj2Zy1foCswPlGme19H8CMO36wBbBHEgSQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21d891d7b89f379ade321fc3c7a87f1719d15a8e636a73e58bdf09fa68b4639f","last_reissued_at":"2026-05-18T04:05:36.820439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:36.820439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6096","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-18T04:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYOGtk2FOxElMEOWaDikiNJ1Jgvq1RYyGzCeJ1e0nAnjVYZAOt471nTEyo3KdIjHfHxz5on28zd3DJRjRkX7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:08:25.668080Z"},"content_sha256":"b2ce27d27da68a726529e93689abf6ea221f0cd21fd684cf1333c8c22168fef5","schema_version":"1.0","event_id":"sha256:b2ce27d27da68a726529e93689abf6ea221f0cd21fd684cf1333c8c22168fef5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EHMJDV5YT43ZVXRSD7B4PKD7C4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving XCSP problems by using Gecode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jacopo Mauro, Massimo Morara, Maurizio Gabbrielli","submitted_at":"2011-12-28T10:49:18Z","abstract_excerpt":"Gecode is one of the most efficient libraries that can be used for constraint solving. However, using it requires dealing with C++ programming details. On the other hand several formats for representing constraint networks have been proposed. Among them, XCSP has been proposed as a format based on XML which allows us to represent constraints defined either extensionally or intensionally, permits global constraints and has been the standard format of the international competition of constraint satisfaction problems solvers. In this paper we present a plug-in for solving problems specified in XC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6096","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-18T04:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7lzhhnHz4EF8poZdOjhwIji0S5+z3Om7XKS+6V0dPWnA11b7AGPXpD+Xh0LXGlrgfTDyYABp09z0odCd7BmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:08:25.668453Z"},"content_sha256":"ce943d759b54cee23b47dd0e271aed0d3e456e2869fcddce8b2c9bae3ceaaa36","schema_version":"1.0","event_id":"sha256:ce943d759b54cee23b47dd0e271aed0d3e456e2869fcddce8b2c9bae3ceaaa36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4/bundle.json","state_url":"https://pith.science/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4/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-05T04:08:25Z","links":{"resolver":"https://pith.science/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4","bundle":"https://pith.science/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4/bundle.json","state":"https://pith.science/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHMJDV5YT43ZVXRSD7B4PKD7C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EHMJDV5YT43ZVXRSD7B4PKD7C4","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":"78c5ba83569b09a702be0d7581a132551d18eabc5192ec25bb3e9aca77834f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-12-28T10:49:18Z","title_canon_sha256":"56682f92ae3afab9aa80843e8b5800ca5ebd5c064a9cefa6d75e2193276fc982"},"schema_version":"1.0","source":{"id":"1112.6096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6096","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6096v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6096","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"EHMJDV5YT43Z","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EHMJDV5YT43ZVXRS","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EHMJDV5Y","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:ce943d759b54cee23b47dd0e271aed0d3e456e2869fcddce8b2c9bae3ceaaa36","target":"graph","created_at":"2026-05-18T04:05:36Z","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":"Gecode is one of the most efficient libraries that can be used for constraint solving. However, using it requires dealing with C++ programming details. On the other hand several formats for representing constraint networks have been proposed. Among them, XCSP has been proposed as a format based on XML which allows us to represent constraints defined either extensionally or intensionally, permits global constraints and has been the standard format of the international competition of constraint satisfaction problems solvers. In this paper we present a plug-in for solving problems specified in XC","authors_text":"Jacopo Mauro, Massimo Morara, Maurizio Gabbrielli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-12-28T10:49:18Z","title":"Solving XCSP problems by using Gecode"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6096","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:b2ce27d27da68a726529e93689abf6ea221f0cd21fd684cf1333c8c22168fef5","target":"record","created_at":"2026-05-18T04:05:36Z","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":"78c5ba83569b09a702be0d7581a132551d18eabc5192ec25bb3e9aca77834f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-12-28T10:49:18Z","title_canon_sha256":"56682f92ae3afab9aa80843e8b5800ca5ebd5c064a9cefa6d75e2193276fc982"},"schema_version":"1.0","source":{"id":"1112.6096","kind":"arxiv","version":1}},"canonical_sha256":"21d891d7b89f379ade321fc3c7a87f1719d15a8e636a73e58bdf09fa68b4639f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21d891d7b89f379ade321fc3c7a87f1719d15a8e636a73e58bdf09fa68b4639f","first_computed_at":"2026-05-18T04:05:36.820439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:36.820439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZQAys5CqaMBDWQmtKjznQadu27fnhwGiusxzaYdLCIqJrea4qZj2Zy1foCswPlGme19H8CMO36wBbBHEgSQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:36.820912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2ce27d27da68a726529e93689abf6ea221f0cd21fd684cf1333c8c22168fef5","sha256:ce943d759b54cee23b47dd0e271aed0d3e456e2869fcddce8b2c9bae3ceaaa36"],"state_sha256":"874f58cebc11903d18a478204d24a481f7ff4d717a5b5fcd5c046787827603d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeHuxfN4kmDdDrgAWkuiffACKScE3sJ0Yuh6U9CTZ6zOVWj6GcnN9LKwAVOtw25bMHk9ii/8mxhYLhhRvaNeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:08:25.670460Z","bundle_sha256":"85fd791c9e5a1fada15d46ed48e551574a169d656baf51aa92050f96b80d7f02"}}