{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:M344AYBGGSIVKNUXNNRZVMW47P","short_pith_number":"pith:M344AYBG","canonical_record":{"source":{"id":"2607.28459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T16:21:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e8c5854b9f0976c781ab25e97ac8aa265fcd763d992bf9b451784e53507fc41c","abstract_canon_sha256":"72af070e164e9563126bb30060d025a20a1d73160e5d3930307c9b7166cc1c2f"},"schema_version":"1.0"},"canonical_sha256":"66f9c0602634915536976b639ab2dcfbcceaabf4484229f6b7e8f99c62ac1462","source":{"kind":"arxiv","id":"2607.28459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28459","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28459v1","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28459","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"M344AYBGGSIV","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"pith_short_16","alias_value":"M344AYBGGSIVKNUX","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"pith_short_8","alias_value":"M344AYBG","created_at":"2026-07-31T01:37:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:M344AYBGGSIVKNUXNNRZVMW47P","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T16:21:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e8c5854b9f0976c781ab25e97ac8aa265fcd763d992bf9b451784e53507fc41c","abstract_canon_sha256":"72af070e164e9563126bb30060d025a20a1d73160e5d3930307c9b7166cc1c2f"},"schema_version":"1.0"},"canonical_sha256":"66f9c0602634915536976b639ab2dcfbcceaabf4484229f6b7e8f99c62ac1462","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f9c0602634915536976b639ab2dcfbcceaabf4484229f6b7e8f99c62ac1462","last_reissued_at":"2026-07-31T01:37:40.986372Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:37:40.986372Z"},"source_kind":"arxiv","source_id":"2607.28459","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-31T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yURymrtkAxGRQ4rvuwsfX+nc1B4Dn3wgvZUQr23nLEUZS9zZRDjs3c6FEE5JCdGnlY4s1B4xorMIwhs82AM4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:15:09.005297Z"},"content_sha256":"a2a57bb741488faad32d70c1d8c0f40f79041a157e1fa3194fc03a12ae1a2015","schema_version":"1.0","event_id":"sha256:a2a57bb741488faad32d70c1d8c0f40f79041a157e1fa3194fc03a12ae1a2015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:M344AYBGGSIVKNUXNNRZVMW47P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Lean","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Pablo Manrique, Stefan Szeider","submitted_at":"2026-07-30T16:21:58Z","abstract_excerpt":"Constraint programming is a core technology for solving complex combinatorial problems in scheduling, planning, configuration, and verification. Trusting its results therefore demands guarantees at two levels: that reformulations applied beforehand are semantics-preserving, and that solvers produce correct answers. In this work, we introduce a framework that addresses both verification levels in the Lean theorem prover: it can be used to prove formulation-level properties, such as equivalence, equisatisfiability, and the correctness of symmetry-breaking constraints, parametrically for entire p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28459","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/2607.28459/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-31T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i28bZ7MuioU1sxQ+KBHAGbE+y3nOYq3XYvoSxdb9Pjf09JAHqj3owxI21jmox1RpBNRt69kl9lEV2OfVM9S3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:15:09.005796Z"},"content_sha256":"0289e2984e27d7ce619e10668fbb24edaa380be2702f24b120ff29f58bf70a15","schema_version":"1.0","event_id":"sha256:0289e2984e27d7ce619e10668fbb24edaa380be2702f24b120ff29f58bf70a15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/bundle.json","state_url":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M344AYBGGSIVKNUXNNRZVMW47P/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-07T17:15:09Z","links":{"resolver":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P","bundle":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/bundle.json","state":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M344AYBGGSIVKNUXNNRZVMW47P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:M344AYBGGSIVKNUXNNRZVMW47P","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":"72af070e164e9563126bb30060d025a20a1d73160e5d3930307c9b7166cc1c2f","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T16:21:58Z","title_canon_sha256":"e8c5854b9f0976c781ab25e97ac8aa265fcd763d992bf9b451784e53507fc41c"},"schema_version":"1.0","source":{"id":"2607.28459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28459","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28459v1","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28459","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"M344AYBGGSIV","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"pith_short_16","alias_value":"M344AYBGGSIVKNUX","created_at":"2026-07-31T01:37:40Z"},{"alias_kind":"pith_short_8","alias_value":"M344AYBG","created_at":"2026-07-31T01:37:40Z"}],"graph_snapshots":[{"event_id":"sha256:0289e2984e27d7ce619e10668fbb24edaa380be2702f24b120ff29f58bf70a15","target":"graph","created_at":"2026-07-31T01:37:40Z","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/2607.28459/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constraint programming is a core technology for solving complex combinatorial problems in scheduling, planning, configuration, and verification. Trusting its results therefore demands guarantees at two levels: that reformulations applied beforehand are semantics-preserving, and that solvers produce correct answers. In this work, we introduce a framework that addresses both verification levels in the Lean theorem prover: it can be used to prove formulation-level properties, such as equivalence, equisatisfiability, and the correctness of symmetry-breaking constraints, parametrically for entire p","authors_text":"Pablo Manrique, Stefan Szeider","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T16:21:58Z","title":"LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Lean"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28459","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:a2a57bb741488faad32d70c1d8c0f40f79041a157e1fa3194fc03a12ae1a2015","target":"record","created_at":"2026-07-31T01:37:40Z","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":"72af070e164e9563126bb30060d025a20a1d73160e5d3930307c9b7166cc1c2f","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T16:21:58Z","title_canon_sha256":"e8c5854b9f0976c781ab25e97ac8aa265fcd763d992bf9b451784e53507fc41c"},"schema_version":"1.0","source":{"id":"2607.28459","kind":"arxiv","version":1}},"canonical_sha256":"66f9c0602634915536976b639ab2dcfbcceaabf4484229f6b7e8f99c62ac1462","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66f9c0602634915536976b639ab2dcfbcceaabf4484229f6b7e8f99c62ac1462","first_computed_at":"2026-07-31T01:37:40.986372Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:37:40.986372Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2a57bb741488faad32d70c1d8c0f40f79041a157e1fa3194fc03a12ae1a2015","sha256:0289e2984e27d7ce619e10668fbb24edaa380be2702f24b120ff29f58bf70a15"],"state_sha256":"0e4ba91424406a07960777152de8f3eacc98a765a7529ec54e9f6542d7f5e6ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5MwWWL/dD5/rgjSa/hl0uB2tTlhXpO9M5HuCwEG88KEv6GZ0NDKNYDWb7hGpnS5HZYNbAdOAiPBHG4ncEYiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:15:09.009911Z","bundle_sha256":"323038e6c878f8d0a03ebb03fc374c91bc127aa5482c72344140029213d75d1e"}}