{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:BMRQIGCRFM6PUHCNJRXJJIWKCC","short_pith_number":"pith:BMRQIGCR","canonical_record":{"source":{"id":"2009.00326","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-09-01T10:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"af993ad737c8d446a9c2345861d0bd5d4af8304d749a7721f41310c5ab8c0d15","abstract_canon_sha256":"c7f6700d3b8f7b57520b16f737a8eb6e2b4c44abd31fcf36e1b688712bd1ecb1"},"schema_version":"1.0"},"canonical_sha256":"0b230418512b3cfa1c4d4c6e94a2ca10b8486b1184a3deac1ae53c731008cdbd","source":{"kind":"arxiv","id":"2009.00326","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.00326","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"2009.00326v6","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.00326","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"BMRQIGCRFM6P","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"pith_short_16","alias_value":"BMRQIGCRFM6PUHCN","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"pith_short_8","alias_value":"BMRQIGCR","created_at":"2026-07-05T09:00:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:BMRQIGCRFM6PUHCNJRXJJIWKCC","target":"record","payload":{"canonical_record":{"source":{"id":"2009.00326","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-09-01T10:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"af993ad737c8d446a9c2345861d0bd5d4af8304d749a7721f41310c5ab8c0d15","abstract_canon_sha256":"c7f6700d3b8f7b57520b16f737a8eb6e2b4c44abd31fcf36e1b688712bd1ecb1"},"schema_version":"1.0"},"canonical_sha256":"0b230418512b3cfa1c4d4c6e94a2ca10b8486b1184a3deac1ae53c731008cdbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:33.800485Z","signature_b64":"GoCH3+9GkDDg0PSndJz2syn8X/+Z/6Vw/rS2APq3mb+Cn1FsREQ5ncc0BmwrmpswbOhoZUv2uQmqs7jdroFMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b230418512b3cfa1c4d4c6e94a2ca10b8486b1184a3deac1ae53c731008cdbd","last_reissued_at":"2026-07-05T09:00:33.800032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:33.800032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.00326","source_version":6,"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-05T09:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwGUOIn7vJVKWA5ByJlTQvbqG2RzIrX6YjWMGxLcgcEPGxvkHlWa4XICCp06hEq+0UlYJRYYKifPKQJUNWY9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:59:38.685888Z"},"content_sha256":"f32748603a62235406c40ce9fb73a327682243fd0164b0e33728400ef7350ff4","schema_version":"1.0","event_id":"sha256:f32748603a62235406c40ce9fb73a327682243fd0164b0e33728400ef7350ff4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:BMRQIGCRFM6PUHCNJRXJJIWKCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PyCSP3: Modeling Combinatorial Constrained Problems in Python","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christophe Lecoutre, Nicolas Szczepanski","submitted_at":"2020-09-01T10:11:31Z","abstract_excerpt":"In this document, we introduce PyCSP$3$, a Python library that allows us to write models of combinatorial constrained problems in a declarative manner. Currently, with PyCSP$3$, you can write models of constraint satisfaction and optimization problems. More specifically, you can build CSP (Constraint Satisfaction Problem) and COP (Constraint Optimization Problem) models. Importantly, there is a complete separation between the modeling and solving phases: you write a model, you compile it (while providing some data) in order to generate an XCSP$3$ instance (file), and you solve that problem ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.00326","kind":"arxiv","version":6},"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.00326/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-05T09:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ifv8nkZUOS1Xnntf1CEbUHlARyv4uH+R8FeFGXUgYW+V16LD8ztvCDyKsLzyEFPhrHgJDQNcTDxpEzGcuWqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:59:38.686654Z"},"content_sha256":"866c3ecb8230d8dd9bf156d78f4f6d582a432ef1943ceb93e78fcd6d5954a498","schema_version":"1.0","event_id":"sha256:866c3ecb8230d8dd9bf156d78f4f6d582a432ef1943ceb93e78fcd6d5954a498"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC/bundle.json","state_url":"https://pith.science/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC/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-19T01:59:38Z","links":{"resolver":"https://pith.science/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC","bundle":"https://pith.science/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC/bundle.json","state":"https://pith.science/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMRQIGCRFM6PUHCNJRXJJIWKCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BMRQIGCRFM6PUHCNJRXJJIWKCC","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":"c7f6700d3b8f7b57520b16f737a8eb6e2b4c44abd31fcf36e1b688712bd1ecb1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-09-01T10:11:31Z","title_canon_sha256":"af993ad737c8d446a9c2345861d0bd5d4af8304d749a7721f41310c5ab8c0d15"},"schema_version":"1.0","source":{"id":"2009.00326","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.00326","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"2009.00326v6","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.00326","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"BMRQIGCRFM6P","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"pith_short_16","alias_value":"BMRQIGCRFM6PUHCN","created_at":"2026-07-05T09:00:33Z"},{"alias_kind":"pith_short_8","alias_value":"BMRQIGCR","created_at":"2026-07-05T09:00:33Z"}],"graph_snapshots":[{"event_id":"sha256:866c3ecb8230d8dd9bf156d78f4f6d582a432ef1943ceb93e78fcd6d5954a498","target":"graph","created_at":"2026-07-05T09:00: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/2009.00326/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this document, we introduce PyCSP$3$, a Python library that allows us to write models of combinatorial constrained problems in a declarative manner. Currently, with PyCSP$3$, you can write models of constraint satisfaction and optimization problems. More specifically, you can build CSP (Constraint Satisfaction Problem) and COP (Constraint Optimization Problem) models. Importantly, there is a complete separation between the modeling and solving phases: you write a model, you compile it (while providing some data) in order to generate an XCSP$3$ instance (file), and you solve that problem ins","authors_text":"Christophe Lecoutre, Nicolas Szczepanski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-09-01T10:11:31Z","title":"PyCSP3: Modeling Combinatorial Constrained Problems in Python"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.00326","kind":"arxiv","version":6},"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:f32748603a62235406c40ce9fb73a327682243fd0164b0e33728400ef7350ff4","target":"record","created_at":"2026-07-05T09:00: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":"c7f6700d3b8f7b57520b16f737a8eb6e2b4c44abd31fcf36e1b688712bd1ecb1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2020-09-01T10:11:31Z","title_canon_sha256":"af993ad737c8d446a9c2345861d0bd5d4af8304d749a7721f41310c5ab8c0d15"},"schema_version":"1.0","source":{"id":"2009.00326","kind":"arxiv","version":6}},"canonical_sha256":"0b230418512b3cfa1c4d4c6e94a2ca10b8486b1184a3deac1ae53c731008cdbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b230418512b3cfa1c4d4c6e94a2ca10b8486b1184a3deac1ae53c731008cdbd","first_computed_at":"2026-07-05T09:00:33.800032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:00:33.800032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GoCH3+9GkDDg0PSndJz2syn8X/+Z/6Vw/rS2APq3mb+Cn1FsREQ5ncc0BmwrmpswbOhoZUv2uQmqs7jdroFMDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:00:33.800485Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.00326","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f32748603a62235406c40ce9fb73a327682243fd0164b0e33728400ef7350ff4","sha256:866c3ecb8230d8dd9bf156d78f4f6d582a432ef1943ceb93e78fcd6d5954a498"],"state_sha256":"045a99cca0347f9833c16876934686a1a8ef978212c24959bf4e6892b184a67c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSN9wCQ/S2XPKxXfpQTjdiQQAyKJEWdcuQFLCBhOr3GYaZrNyrmhTiNGeJc1flpO5OCGun0hTvISLm0m3ucHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T01:59:38.692050Z","bundle_sha256":"e02e27dcac7145f3d9789a7a567d33a7d1050b3e64c53fad98cf91160a2ce562"}}