{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NRJ4E4CJDWU6VUG2NDB3DS7ILV","short_pith_number":"pith:NRJ4E4CJ","canonical_record":{"source":{"id":"1401.4330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-17T12:58:52Z","cross_cats_sorted":[],"title_canon_sha256":"364a48d924b0996428f78c8756c6c2f98139418271e60d8a5741fddbc1ffb766","abstract_canon_sha256":"785d5390ae0a7fdd94b8d0b637f4557631cf05c57967128e872323afe36a39a3"},"schema_version":"1.0"},"canonical_sha256":"6c53c270491da9ead0da68c3b1cbe85d74868e16435eb675c16c2d8afc5a4c4d","source":{"kind":"arxiv","id":"1401.4330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4330","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4330v1","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4330","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"pith_short_12","alias_value":"NRJ4E4CJDWU6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NRJ4E4CJDWU6VUG2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NRJ4E4CJ","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NRJ4E4CJDWU6VUG2NDB3DS7ILV","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-17T12:58:52Z","cross_cats_sorted":[],"title_canon_sha256":"364a48d924b0996428f78c8756c6c2f98139418271e60d8a5741fddbc1ffb766","abstract_canon_sha256":"785d5390ae0a7fdd94b8d0b637f4557631cf05c57967128e872323afe36a39a3"},"schema_version":"1.0"},"canonical_sha256":"6c53c270491da9ead0da68c3b1cbe85d74868e16435eb675c16c2d8afc5a4c4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:55.281465Z","signature_b64":"koTNsEtxlQeGbg02XHzDQJc+fsPeD/caan3ol5mmd+wJ0YdrBaPX6ItW/x+HrIuxkGKPenkmjZ0jG8+TspeKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c53c270491da9ead0da68c3b1cbe85d74868e16435eb675c16c2d8afc5a4c4d","last_reissued_at":"2026-05-18T03:01:55.280987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:55.280987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4330","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-18T03:01:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRmoX2iDUXdLwaik/pWOH2eTbg/SyrydehIppxPaWqMJbGDEwPcZu6Ls76SuUJ64TdviLTYMVmT/5ItJxK0wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:40.065024Z"},"content_sha256":"3e4efb537a677ca43f4e69ecdd2984642d9ff7a8bb3033be63f5c699e1dc52eb","schema_version":"1.0","event_id":"sha256:3e4efb537a677ca43f4e69ecdd2984642d9ff7a8bb3033be63f5c699e1dc52eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NRJ4E4CJDWU6VUG2NDB3DS7ILV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Introduction of Quantified Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Leitsch, Daniel Weller, Giselle Reis, Stefan Hetzl","submitted_at":"2014-01-17T12:58:52Z","abstract_excerpt":"We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize such a compression. Finally, a proof using these cut-formulas is constructed. This method allows an exponential compression of proof length. It can be applied to the output of automated theorem provers, which typically produce analytic proofs. An implementation is available on the web and described in this paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4330","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-18T03:01:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPMQx2EqJytQrxqwWzZMZk+v2yoyNx0s3lggj1aZV6TeOCznKqGiobWY0RNWAw12xTD2o5ytApiHrE3HPf4SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:40.065658Z"},"content_sha256":"d7ab348a66888a3d3b2ae9eb88c81c3ed53f88de2dc371d67e9146f0472cac89","schema_version":"1.0","event_id":"sha256:d7ab348a66888a3d3b2ae9eb88c81c3ed53f88de2dc371d67e9146f0472cac89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV/bundle.json","state_url":"https://pith.science/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV/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-31T01:17:40Z","links":{"resolver":"https://pith.science/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV","bundle":"https://pith.science/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV/bundle.json","state":"https://pith.science/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRJ4E4CJDWU6VUG2NDB3DS7ILV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NRJ4E4CJDWU6VUG2NDB3DS7ILV","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":"785d5390ae0a7fdd94b8d0b637f4557631cf05c57967128e872323afe36a39a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-17T12:58:52Z","title_canon_sha256":"364a48d924b0996428f78c8756c6c2f98139418271e60d8a5741fddbc1ffb766"},"schema_version":"1.0","source":{"id":"1401.4330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4330","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4330v1","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4330","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"pith_short_12","alias_value":"NRJ4E4CJDWU6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NRJ4E4CJDWU6VUG2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NRJ4E4CJ","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d7ab348a66888a3d3b2ae9eb88c81c3ed53f88de2dc371d67e9146f0472cac89","target":"graph","created_at":"2026-05-18T03:01:55Z","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":"We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize such a compression. Finally, a proof using these cut-formulas is constructed. This method allows an exponential compression of proof length. It can be applied to the output of automated theorem provers, which typically produce analytic proofs. An implementation is available on the web and described in this paper.","authors_text":"Alexander Leitsch, Daniel Weller, Giselle Reis, Stefan Hetzl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-17T12:58:52Z","title":"Algorithmic Introduction of Quantified Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4330","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:3e4efb537a677ca43f4e69ecdd2984642d9ff7a8bb3033be63f5c699e1dc52eb","target":"record","created_at":"2026-05-18T03:01:55Z","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":"785d5390ae0a7fdd94b8d0b637f4557631cf05c57967128e872323afe36a39a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-17T12:58:52Z","title_canon_sha256":"364a48d924b0996428f78c8756c6c2f98139418271e60d8a5741fddbc1ffb766"},"schema_version":"1.0","source":{"id":"1401.4330","kind":"arxiv","version":1}},"canonical_sha256":"6c53c270491da9ead0da68c3b1cbe85d74868e16435eb675c16c2d8afc5a4c4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c53c270491da9ead0da68c3b1cbe85d74868e16435eb675c16c2d8afc5a4c4d","first_computed_at":"2026-05-18T03:01:55.280987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:55.280987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"koTNsEtxlQeGbg02XHzDQJc+fsPeD/caan3ol5mmd+wJ0YdrBaPX6ItW/x+HrIuxkGKPenkmjZ0jG8+TspeKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:55.281465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e4efb537a677ca43f4e69ecdd2984642d9ff7a8bb3033be63f5c699e1dc52eb","sha256:d7ab348a66888a3d3b2ae9eb88c81c3ed53f88de2dc371d67e9146f0472cac89"],"state_sha256":"f94cdb5fa7f86dde85d1692ad6be171a396c9287bede2bbab3b66131a6cb2f94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0I23WGy4bf7uq6mk+9N2/PomjOjK2qpUR3msHK7jEenwPZwnznYxQzejSK4ogHKKZjEIJoT21XPZ15xUo1nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:17:40.068880Z","bundle_sha256":"1a0d484152aea44801e25a671b0cd5bbd45b94a28752bca01b7e48f82d9ef40d"}}