{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T4YG25RDKUWVRZYC4PKPLTVF47","short_pith_number":"pith:T4YG25RD","canonical_record":{"source":{"id":"1503.08551","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T06:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"4ec76d50d493f31330302563039bf9193df5216f46a2cbca5c7ed96062dda162","abstract_canon_sha256":"15e9f9d705d87cb425d321bc506d45f8606866b304ca2b55576485fa3cba7c59"},"schema_version":"1.0"},"canonical_sha256":"9f306d7623552d58e702e3d4f5cea5e7cf31b1df74164a8516ed462ec1d9496e","source":{"kind":"arxiv","id":"1503.08551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08551","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08551v1","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08551","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"T4YG25RDKUWV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4YG25RDKUWVRZYC","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4YG25RD","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T4YG25RDKUWVRZYC4PKPLTVF47","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08551","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T06:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"4ec76d50d493f31330302563039bf9193df5216f46a2cbca5c7ed96062dda162","abstract_canon_sha256":"15e9f9d705d87cb425d321bc506d45f8606866b304ca2b55576485fa3cba7c59"},"schema_version":"1.0"},"canonical_sha256":"9f306d7623552d58e702e3d4f5cea5e7cf31b1df74164a8516ed462ec1d9496e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:01.434672Z","signature_b64":"257vytFrEhOeJDQhS8Ve4EjsIyf3gDe9uSmBlfZBCsFdG7Xz2USqJH7XRQdyCucwTT/BaxafDyTjO0NpptHEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f306d7623552d58e702e3d4f5cea5e7cf31b1df74164a8516ed462ec1d9496e","last_reissued_at":"2026-05-18T02:20:01.434024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:01.434024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08551","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-05-18T02:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsom4aJ6lUCAFc2UGHwiRP1JLYRJQQNtJmHjy1ccP9d8KeMDA4vWCuKw+5c7HAnx9yKKNT7MVaYCfd5m3P9MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:29:47.082495Z"},"content_sha256":"f85b963c7b692fa8737723ce237e28a45065f5da8c2c2e566f012ddbbe446dc5","schema_version":"1.0","event_id":"sha256:f85b963c7b692fa8737723ce237e28a45065f5da8c2c2e566f012ddbbe446dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T4YG25RDKUWVRZYC4PKPLTVF47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Clause set Schema Aided by Automated Theorem Proving: A Case Study [Extended Paper]","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Leitsch, David Cerna","submitted_at":"2015-03-30T06:31:25Z","abstract_excerpt":"The schematic CERES method [8] is a recently developed method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way to circumvent adding an induction rule to the LK-calculus. In this work, we formalize a schematic version of the infinitary pigeonhole principle, which we call the Non-injectivity Assertion schema (NiA-schema), in the LKS-calculus [8], and analyse the clause set schema extracted from the NiA-schema using some of the structure provided by the schematic CERES method. To the best of our knowledge,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08551","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"},"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-05-18T02:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eHNd8z6MOekzjwD6SETGYmHpIdjSCxUkawImq0L/5l/5wwFd2Pg8/kxm1/S4kzcBPBo0HBj7yy4kX97Bo+CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:29:47.082858Z"},"content_sha256":"e96ca0f8f439cee641b06dc6328ff73551d2f7f3ba4495ef7eba26f9605d457d","schema_version":"1.0","event_id":"sha256:e96ca0f8f439cee641b06dc6328ff73551d2f7f3ba4495ef7eba26f9605d457d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4YG25RDKUWVRZYC4PKPLTVF47/bundle.json","state_url":"https://pith.science/pith/T4YG25RDKUWVRZYC4PKPLTVF47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4YG25RDKUWVRZYC4PKPLTVF47/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-05-31T00:29:47Z","links":{"resolver":"https://pith.science/pith/T4YG25RDKUWVRZYC4PKPLTVF47","bundle":"https://pith.science/pith/T4YG25RDKUWVRZYC4PKPLTVF47/bundle.json","state":"https://pith.science/pith/T4YG25RDKUWVRZYC4PKPLTVF47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4YG25RDKUWVRZYC4PKPLTVF47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T4YG25RDKUWVRZYC4PKPLTVF47","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":"15e9f9d705d87cb425d321bc506d45f8606866b304ca2b55576485fa3cba7c59","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T06:31:25Z","title_canon_sha256":"4ec76d50d493f31330302563039bf9193df5216f46a2cbca5c7ed96062dda162"},"schema_version":"1.0","source":{"id":"1503.08551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08551","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08551v1","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08551","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"T4YG25RDKUWV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4YG25RDKUWVRZYC","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4YG25RD","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:e96ca0f8f439cee641b06dc6328ff73551d2f7f3ba4495ef7eba26f9605d457d","target":"graph","created_at":"2026-05-18T02:20:01Z","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"},"paper":{"abstract_excerpt":"The schematic CERES method [8] is a recently developed method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way to circumvent adding an induction rule to the LK-calculus. In this work, we formalize a schematic version of the infinitary pigeonhole principle, which we call the Non-injectivity Assertion schema (NiA-schema), in the LKS-calculus [8], and analyse the clause set schema extracted from the NiA-schema using some of the structure provided by the schematic CERES method. To the best of our knowledge,","authors_text":"Alexander Leitsch, David Cerna","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T06:31:25Z","title":"Analysis of Clause set Schema Aided by Automated Theorem Proving: A Case Study [Extended Paper]"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08551","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:f85b963c7b692fa8737723ce237e28a45065f5da8c2c2e566f012ddbbe446dc5","target":"record","created_at":"2026-05-18T02:20:01Z","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":"15e9f9d705d87cb425d321bc506d45f8606866b304ca2b55576485fa3cba7c59","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T06:31:25Z","title_canon_sha256":"4ec76d50d493f31330302563039bf9193df5216f46a2cbca5c7ed96062dda162"},"schema_version":"1.0","source":{"id":"1503.08551","kind":"arxiv","version":1}},"canonical_sha256":"9f306d7623552d58e702e3d4f5cea5e7cf31b1df74164a8516ed462ec1d9496e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f306d7623552d58e702e3d4f5cea5e7cf31b1df74164a8516ed462ec1d9496e","first_computed_at":"2026-05-18T02:20:01.434024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:01.434024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"257vytFrEhOeJDQhS8Ve4EjsIyf3gDe9uSmBlfZBCsFdG7Xz2USqJH7XRQdyCucwTT/BaxafDyTjO0NpptHEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:01.434672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f85b963c7b692fa8737723ce237e28a45065f5da8c2c2e566f012ddbbe446dc5","sha256:e96ca0f8f439cee641b06dc6328ff73551d2f7f3ba4495ef7eba26f9605d457d"],"state_sha256":"09367e137d8abae1ee05d1e4d276d734cafffe3f05afb6c29a9d00c886e7a14a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7lbO82daGOGeIaRhJijax1e53b4pW5bRftFrUt7i2HtLKEn9LcqTusgNvnggQHfckWlBwvMEAk8mZ/eVJ7uCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:29:47.084912Z","bundle_sha256":"bb4a45e3719923a492d614ecaa0dc78483f3018727e94f622a246f7e650bc37a"}}