{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DAHGRXTTTFNB2NWPDL2A6UVENL","short_pith_number":"pith:DAHGRXTT","schema_version":"1.0","canonical_sha256":"180e68de73995a1d36cf1af40f52a46afc5c3502d22a9f5a8288d205abfcd282","source":{"kind":"arxiv","id":"1701.05251","version":1},"attestation_state":"computed","paper":{"title":"CERES in Propositional Proof Schemata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Andrea Condoluci","submitted_at":"2017-01-18T22:35:12Z","abstract_excerpt":"Cut-elimination is one of the most famous problems in proof theory, and it was defined and solved for first-order sequent calculus by Gentzen in his celebrated Hauptsatz. Ceres is a different cut-elimination algorithm for first- and higher-order classical logic. Ceres was extended to proof schemata, which are templates for usual first-order proofs, with parameters for natural numbers. However, while Ceres is known to be a complete cut-elimination algorithm for first-order logic, it is not clear whether this holds for first-order schemata too: given in input a proof schema with cuts, does Ceres"},"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":"1701.05251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-18T22:35:12Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"ea53087f011baa65e173355110f01be7d3b279da9349eead34ff57fc0b67a62c","abstract_canon_sha256":"829756ba31028e5bd2ef8e8247bb57dc362ebc78557462726502d883dd7b36b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.417761Z","signature_b64":"KYxUAc3jg49g/n23rvRgYxdGVPgEYsTd3HnVLnmAF8HRz5Si9Me3Wm0iB4RfOQelt/kKee4Z0AasLON6mdhEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"180e68de73995a1d36cf1af40f52a46afc5c3502d22a9f5a8288d205abfcd282","last_reissued_at":"2026-05-18T00:52:30.417382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.417382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CERES in Propositional Proof Schemata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Andrea Condoluci","submitted_at":"2017-01-18T22:35:12Z","abstract_excerpt":"Cut-elimination is one of the most famous problems in proof theory, and it was defined and solved for first-order sequent calculus by Gentzen in his celebrated Hauptsatz. Ceres is a different cut-elimination algorithm for first- and higher-order classical logic. Ceres was extended to proof schemata, which are templates for usual first-order proofs, with parameters for natural numbers. However, while Ceres is known to be a complete cut-elimination algorithm for first-order logic, it is not clear whether this holds for first-order schemata too: given in input a proof schema with cuts, does Ceres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05251","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.05251","created_at":"2026-05-18T00:52:30.417436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05251v1","created_at":"2026-05-18T00:52:30.417436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05251","created_at":"2026-05-18T00:52:30.417436+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAHGRXTTTFNB","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAHGRXTTTFNB2NWP","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAHGRXTT","created_at":"2026-05-18T12:31:10.602751+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/DAHGRXTTTFNB2NWPDL2A6UVENL","json":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL.json","graph_json":"https://pith.science/api/pith-number/DAHGRXTTTFNB2NWPDL2A6UVENL/graph.json","events_json":"https://pith.science/api/pith-number/DAHGRXTTTFNB2NWPDL2A6UVENL/events.json","paper":"https://pith.science/paper/DAHGRXTT"},"agent_actions":{"view_html":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL","download_json":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL.json","view_paper":"https://pith.science/paper/DAHGRXTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05251&json=true","fetch_graph":"https://pith.science/api/pith-number/DAHGRXTTTFNB2NWPDL2A6UVENL/graph.json","fetch_events":"https://pith.science/api/pith-number/DAHGRXTTTFNB2NWPDL2A6UVENL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL/action/storage_attestation","attest_author":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL/action/author_attestation","sign_citation":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL/action/citation_signature","submit_replication":"https://pith.science/pith/DAHGRXTTTFNB2NWPDL2A6UVENL/action/replication_record"}},"created_at":"2026-05-18T00:52:30.417436+00:00","updated_at":"2026-05-18T00:52:30.417436+00:00"}