{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","short_pith_number":"pith:2ARZKMHH","canonical_record":{"source":{"id":"2607.21199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-07-23T11:19:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9c3569b4140f38d877b64d30500518166151f3e3414b35c42982e2ff0da933c0","abstract_canon_sha256":"df1464124049bf89b4b591e8541b32face5931b035ed9b3cc85c5c3b290f475b"},"schema_version":"1.0"},"canonical_sha256":"d0239530e7fea429f2f3a288d039ff508fb10f71bc29cb69168fcc1219469253","source":{"kind":"arxiv","id":"2607.21199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21199","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21199v1","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21199","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"pith_short_12","alias_value":"2ARZKMHH72SC","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ARZKMHH72SCT4XT","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ARZKMHH","created_at":"2026-07-24T01:24:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","target":"record","payload":{"canonical_record":{"source":{"id":"2607.21199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-07-23T11:19:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9c3569b4140f38d877b64d30500518166151f3e3414b35c42982e2ff0da933c0","abstract_canon_sha256":"df1464124049bf89b4b591e8541b32face5931b035ed9b3cc85c5c3b290f475b"},"schema_version":"1.0"},"canonical_sha256":"d0239530e7fea429f2f3a288d039ff508fb10f71bc29cb69168fcc1219469253","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:24:18.662111Z","signature_b64":"Ul5bCNMnkjfAncG6FM3+rCmrH66SgwbWDhcUqNUpFU5PumMk7UsbWANCN8QlV1gJ3ekTy2uCld9h6Rk8p6XIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0239530e7fea429f2f3a288d039ff508fb10f71bc29cb69168fcc1219469253","last_reissued_at":"2026-07-24T01:24:18.661111Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:24:18.661111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.21199","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-24T01:24:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DegyIpMSFURlKkLoiveE3uVFeNuhqRRtATS1Jl8YVlUle0axYBQfsQLgoPEigW+fWTkFw86Jg4alIYKgF66UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:26:40.480882Z"},"content_sha256":"9d528601ad3feff50c6fa0f140d73e2df88c53121ce51fa4984e43542bbb5d23","schema_version":"1.0","event_id":"sha256:9d528601ad3feff50c6fa0f140d73e2df88c53121ce51fa4984e43542bbb5d23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a Certifying Grounder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Alexander Ek, Bart Bogaerts, Carlos Cantero, Daimy Van Caudenberg","submitted_at":"2026-07-23T11:19:24Z","abstract_excerpt":"Grounding, the translation of high-level theories into equivalent quantifier-free formulas, is a crucial step in declarative solving, yet it has so far escaped the proof-logging revolution. When this grounding step is not certifying, there is no way of knowing that the obtained solutions actually correspond to the original problem specification, resulting in a trust gap. \n  In this paper, we close the trust gap between the user's high-level specification and the solver's low-level input by introducing a novel certifying grounding framework for first-order logic model expansion (FOX) over finit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21199","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.21199/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-24T01:24:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBHiRJNFeNWOu4mXZWAkM8evl59FeUe8Kb9EOVKzsHRB8gqMjkHl6BoAz1HrARC947xdEnXs8zYsYCAZqR+iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:26:40.481438Z"},"content_sha256":"04277c33f104aa34d8a0de96e8fc60e06ca1b855e71c9dae34bf1fcacbcf7295","schema_version":"1.0","event_id":"sha256:04277c33f104aa34d8a0de96e8fc60e06ca1b855e71c9dae34bf1fcacbcf7295"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.34727/2022/isbn.978-3-85448-053-2_10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Andres Nötzli, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Andrew Reynolds, Clark W. Barrett & Cesare Tinelli (2022): Reconstructing Fine-Grained Proofs of Rewrites Using a Domain-Specific Language . In: Formal Methods in Computer-Aided ","arxiv_id":"2607.21199","detector":"doi_compliance","evidence":{"ref_index":36,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.34727/2022/isbn.978-3-85448-","reconstructed_doi":"10.34727/2022/isbn.978-3-85448-053-2_10"},"severity":"advisory","ref_index":36,"audited_at":"2026-08-01T08:19:58.377654Z","event_type":"pith.integrity.v1","detected_doi":"10.34727/2022/isbn.978-3-85448-053-2_10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f61ba80afb1ea64f947892580befd3e0112d82f89794dfe18886428906992cde","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15458,"payload_sha256":"d000d2e473637b9b658899d6157d5f40fbce4b068aade5feee80eed05aaef676","signature_b64":"Eytx7OFbAsEFnEeXLFWeu09V8wkUvvV0mTZHG7Kh1qhf/QuDkBHc0gJQiafnnYocebcgvPRj3ZPsCN5bNsDEBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBGj3KvhB7eW4YlOCaTs/LKuyZIjngGs7QD8hHdOn4Y8FecJ74UFue/NZmQGsHShXrDN96xQ1A+7vcqoI2wFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:26:40.485805Z"},"content_sha256":"93c8d82a7282fb2642075366db0626133507b2a5e49582a0a2b4e61947f026d0","schema_version":"1.0","event_id":"sha256:93c8d82a7282fb2642075366db0626133507b2a5e49582a0a2b4e61947f026d0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/3-540-45241-9_12) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Monica L. Nogueira, Marcello Balduccini, Michael Gelfond, Richard Watson & Matthew Barry (2001): An A-Prolog Decision Support System for the Space Shuttle . In I. V . Ramakrishnan, editor: Practical Aspects of Declarative Languages, Third I","arxiv_id":"2607.21199","detector":"doi_compliance","evidence":{"ref_index":35,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/3-","reconstructed_doi":"10.1007/3-540-45241-9_12"},"severity":"advisory","ref_index":35,"audited_at":"2026-08-01T08:19:58.377654Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/3-540-45241-9_12","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8caea765dd883dbf384b2c0dbba313a502055b1e3daf51941bde26299a9f01ab","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15457,"payload_sha256":"99b635ed27d07e5c57ffb26fe8d69d7ba7640cbf60a4110fc82f99fd40d0d4b9","signature_b64":"YxakSmMKaLg5uZb3IrEINq7aRl4oLxA7JYleC72Qv6gRfCj/nUf+zxutEO92wDXWYUU7HDIjntJnz8aDx3ZyDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GucE2lLVkaXqa7sAiT/FmxKqq7ib9ces620Cfd3MSsXX7sctd00eWtFlRr3m6WnwZUqtG6SR/9WQ1fHQxXu6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:26:40.486182Z"},"content_sha256":"14e6620cddda48d69dd43c7aac4d1e362f5f98b8972aa0db5fa7548d776d5fef","schema_version":"1.0","event_id":"sha256:14e6620cddda48d69dd43c7aac4d1e362f5f98b8972aa0db5fa7548d776d5fef"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-08587-6_7) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Marijn Heule, Martina Seidl & Armin Biere (2014): A Unified Proof System for QBF Preprocessing . In Stéphane Demri, Deepak Kapur & Christoph Weidenbach, editors: Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as ","arxiv_id":"2607.21199","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-","reconstructed_doi":"10.1007/978-3-319-08587-6_7"},"severity":"advisory","ref_index":22,"audited_at":"2026-08-01T08:19:58.377654Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-319-08587-6_7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"af3da91d7bb0f14b47973baafbaeae5659a7ffc14aae667104c1209b1c4459f1","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15456,"payload_sha256":"e30bcb0e81fdf38d118503a46d41c637b302e32fc25b14b48cf1d446532c9bcc","signature_b64":"qiXJ/yEx9SKxglmRoWDjQ7+WZtL5CKW7loffPINmyx9j2nCIkFr3reyF0whz2+FXCz4WplEkmWiiV/giMjmjBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPCQgKozgibRyQ5rT1/Z8NvYuExP2OmWf7c+moxz3c3PAyTF91HZjdBjIGYb/oROuPrAQug67qWGO4mIahiTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:26:40.486597Z"},"content_sha256":"eced09e22990de9d8f9ee1322864eb0a557f50ba6c17d5babd07ad864dd8bcf6","schema_version":"1.0","event_id":"sha256:eced09e22990de9d8f9ee1322864eb0a557f50ba6c17d5babd07ad864dd8bcf6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10817-018-09502-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury & Pascal Fontaine (2020): Scalable Fine- Grained Proofs for Formula Processing. J. Autom. Reason. 64(3), pp. 485–510, doi:10.1007/s10817-018- 09502-y","arxiv_id":"2607.21199","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10817-018-","reconstructed_doi":"10.1007/s10817-018-09502-y"},"severity":"advisory","ref_index":4,"audited_at":"2026-08-01T08:19:58.377654Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10817-018-09502-y","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c271c4d4136bfe89c11a83a474c5dd9995d2316fef42b8874ff79340c3c56d10","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15455,"payload_sha256":"bf17f81d81efe8561d5a6fa054cb7ede9d4b018bdaadc7818ab4d8d302ac6500","signature_b64":"bcRZ6gYCnptt/xYKI82tV2rkdFu6PC2RSxEKIboF2KjnT0FQ9tEBkor2890LzcmsriCrZ2yJ5jUMNv36mnLOBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6mt+SUYn0r0yFf10iltuEz4kpZMceXZguzDOg9UN/+OlaXD0G6ZP6t1adpguEdr8BeOQtqFh6pzX9TXqCRoHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:26:40.487000Z"},"content_sha256":"c974de91dc02a91368a1b2e0e7effc0b633d35db6933bd49789f1832c99a964c","schema_version":"1.0","event_id":"sha256:c974de91dc02a91368a1b2e0e7effc0b633d35db6933bd49789f1832c99a964c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ARZKMHH72SCT4XTUKENAOP7KC/bundle.json","state_url":"https://pith.science/pith/2ARZKMHH72SCT4XTUKENAOP7KC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ARZKMHH72SCT4XTUKENAOP7KC/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-13T20:26:40Z","links":{"resolver":"https://pith.science/pith/2ARZKMHH72SCT4XTUKENAOP7KC","bundle":"https://pith.science/pith/2ARZKMHH72SCT4XTUKENAOP7KC/bundle.json","state":"https://pith.science/pith/2ARZKMHH72SCT4XTUKENAOP7KC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ARZKMHH72SCT4XTUKENAOP7KC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2ARZKMHH72SCT4XTUKENAOP7KC","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"df1464124049bf89b4b591e8541b32face5931b035ed9b3cc85c5c3b290f475b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-07-23T11:19:24Z","title_canon_sha256":"9c3569b4140f38d877b64d30500518166151f3e3414b35c42982e2ff0da933c0"},"schema_version":"1.0","source":{"id":"2607.21199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21199","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21199v1","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21199","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"pith_short_12","alias_value":"2ARZKMHH72SC","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ARZKMHH72SCT4XT","created_at":"2026-07-24T01:24:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ARZKMHH","created_at":"2026-07-24T01:24:18Z"}],"graph_snapshots":[{"event_id":"sha256:04277c33f104aa34d8a0de96e8fc60e06ca1b855e71c9dae34bf1fcacbcf7295","target":"graph","created_at":"2026-07-24T01:24:18Z","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.21199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Grounding, the translation of high-level theories into equivalent quantifier-free formulas, is a crucial step in declarative solving, yet it has so far escaped the proof-logging revolution. When this grounding step is not certifying, there is no way of knowing that the obtained solutions actually correspond to the original problem specification, resulting in a trust gap. \n  In this paper, we close the trust gap between the user's high-level specification and the solver's low-level input by introducing a novel certifying grounding framework for first-order logic model expansion (FOX) over finit","authors_text":"Alexander Ek, Bart Bogaerts, Carlos Cantero, Daimy Van Caudenberg","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-07-23T11:19:24Z","title":"Towards a Certifying Grounder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21199","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:9d528601ad3feff50c6fa0f140d73e2df88c53121ce51fa4984e43542bbb5d23","target":"record","created_at":"2026-07-24T01:24:18Z","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":"df1464124049bf89b4b591e8541b32face5931b035ed9b3cc85c5c3b290f475b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-07-23T11:19:24Z","title_canon_sha256":"9c3569b4140f38d877b64d30500518166151f3e3414b35c42982e2ff0da933c0"},"schema_version":"1.0","source":{"id":"2607.21199","kind":"arxiv","version":1}},"canonical_sha256":"d0239530e7fea429f2f3a288d039ff508fb10f71bc29cb69168fcc1219469253","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0239530e7fea429f2f3a288d039ff508fb10f71bc29cb69168fcc1219469253","first_computed_at":"2026-07-24T01:24:18.661111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T01:24:18.661111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ul5bCNMnkjfAncG6FM3+rCmrH66SgwbWDhcUqNUpFU5PumMk7UsbWANCN8QlV1gJ3ekTy2uCld9h6Rk8p6XIAw==","signature_status":"signed_v1","signed_at":"2026-07-24T01:24:18.662111Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.21199","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:14e6620cddda48d69dd43c7aac4d1e362f5f98b8972aa0db5fa7548d776d5fef","sha256:93c8d82a7282fb2642075366db0626133507b2a5e49582a0a2b4e61947f026d0","sha256:c974de91dc02a91368a1b2e0e7effc0b633d35db6933bd49789f1832c99a964c","sha256:eced09e22990de9d8f9ee1322864eb0a557f50ba6c17d5babd07ad864dd8bcf6"]}],"invalid_events":[],"applied_event_ids":["sha256:9d528601ad3feff50c6fa0f140d73e2df88c53121ce51fa4984e43542bbb5d23","sha256:04277c33f104aa34d8a0de96e8fc60e06ca1b855e71c9dae34bf1fcacbcf7295"],"state_sha256":"e130ada082597a3c6985d359e76f1b72a8dd987484d9ffde8d196ca9aa5399f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aps0r72tY4pijeiKz2bIrKM4WmlqLRws+A45Nex18qx2tmYkwtd1JaszlbzzQEotfrdjyrgJCOUU+u6ZhGJFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:26:40.490276Z","bundle_sha256":"a22589acd7a730e23cdb0eed0ef930d4317aa9e5778d07d01512e318673a2806"}}