{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:M344AYBGGSIVKNUXNNRZVMW47P","short_pith_number":"pith:M344AYBG","schema_version":"1.0","canonical_sha256":"66f9c0602634915536976b639ab2dcfbcceaabf4484229f6b7e8f99c62ac1462","source":{"kind":"arxiv","id":"2607.28459","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.28459","created_at":"2026-07-31T01:37:40.989611+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28459v1","created_at":"2026-07-31T01:37:40.989611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28459","created_at":"2026-07-31T01:37:40.989611+00:00"},{"alias_kind":"pith_short_12","alias_value":"M344AYBGGSIV","created_at":"2026-07-31T01:37:40.989611+00:00"},{"alias_kind":"pith_short_16","alias_value":"M344AYBGGSIVKNUX","created_at":"2026-07-31T01:37:40.989611+00:00"},{"alias_kind":"pith_short_8","alias_value":"M344AYBG","created_at":"2026-07-31T01:37:40.989611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P","json":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P.json","graph_json":"https://pith.science/api/pith-number/M344AYBGGSIVKNUXNNRZVMW47P/graph.json","events_json":"https://pith.science/api/pith-number/M344AYBGGSIVKNUXNNRZVMW47P/events.json","paper":"https://pith.science/paper/M344AYBG"},"agent_actions":{"view_html":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P","download_json":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P.json","view_paper":"https://pith.science/paper/M344AYBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28459&json=true","fetch_graph":"https://pith.science/api/pith-number/M344AYBGGSIVKNUXNNRZVMW47P/graph.json","fetch_events":"https://pith.science/api/pith-number/M344AYBGGSIVKNUXNNRZVMW47P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/action/storage_attestation","attest_author":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/action/author_attestation","sign_citation":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/action/citation_signature","submit_replication":"https://pith.science/pith/M344AYBGGSIVKNUXNNRZVMW47P/action/replication_record"}},"created_at":"2026-07-31T01:37:40.989611+00:00","updated_at":"2026-07-31T01:37:40.989611+00:00"}