{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W6WN3SY5YGCFOZSFTDPFQVAL7E","short_pith_number":"pith:W6WN3SY5","schema_version":"1.0","canonical_sha256":"b7acddcb1dc18457664598de58540bf9060ece105cfd28a3a4fb5f4e0b82f302","source":{"kind":"arxiv","id":"1308.0428","version":1},"attestation_state":"computed","paper":{"title":"Expansion Trees with Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Daniel Weller, Stefan Hetzl","submitted_at":"2013-08-02T07:54:30Z","abstract_excerpt":"Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances have been chosen for which quantifiers, known in the literature as expansion trees.\n  Such a representation is inherently analytic and hence corresponds to a cut-free sequent calculus proof. Recently several extensions of such proof representations to proofs with cut have been proposed. These extensions are based on graphical formalisms similar to proof nets an"},"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":"1308.0428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-02T07:54:30Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"26c3f6f17646a99dacc6cbff78a1baa01089bdd2e867723c1d389498e1bd5358","abstract_canon_sha256":"989090623bd4a504743f4fb08798db36375d63912e363595c1ef938f986af200"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:50.522522Z","signature_b64":"BjS7gEvRRAEHpJzwC2KDdH6hXSTrz/FIh2CZBoJEnyje7AkwoexvWWHQq5spZCTOiKfyRI4fjCtRqkNcbz05Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7acddcb1dc18457664598de58540bf9060ece105cfd28a3a4fb5f4e0b82f302","last_reissued_at":"2026-05-18T03:16:50.521853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:50.521853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expansion Trees with Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Daniel Weller, Stefan Hetzl","submitted_at":"2013-08-02T07:54:30Z","abstract_excerpt":"Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances have been chosen for which quantifiers, known in the literature as expansion trees.\n  Such a representation is inherently analytic and hence corresponds to a cut-free sequent calculus proof. Recently several extensions of such proof representations to proofs with cut have been proposed. These extensions are based on graphical formalisms similar to proof nets an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0428","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":"1308.0428","created_at":"2026-05-18T03:16:50.521966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0428v1","created_at":"2026-05-18T03:16:50.521966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0428","created_at":"2026-05-18T03:16:50.521966+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6WN3SY5YGCF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6WN3SY5YGCFOZSF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6WN3SY5","created_at":"2026-05-18T12:28:04.890932+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/W6WN3SY5YGCFOZSFTDPFQVAL7E","json":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E.json","graph_json":"https://pith.science/api/pith-number/W6WN3SY5YGCFOZSFTDPFQVAL7E/graph.json","events_json":"https://pith.science/api/pith-number/W6WN3SY5YGCFOZSFTDPFQVAL7E/events.json","paper":"https://pith.science/paper/W6WN3SY5"},"agent_actions":{"view_html":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E","download_json":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E.json","view_paper":"https://pith.science/paper/W6WN3SY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0428&json=true","fetch_graph":"https://pith.science/api/pith-number/W6WN3SY5YGCFOZSFTDPFQVAL7E/graph.json","fetch_events":"https://pith.science/api/pith-number/W6WN3SY5YGCFOZSFTDPFQVAL7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E/action/storage_attestation","attest_author":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E/action/author_attestation","sign_citation":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E/action/citation_signature","submit_replication":"https://pith.science/pith/W6WN3SY5YGCFOZSFTDPFQVAL7E/action/replication_record"}},"created_at":"2026-05-18T03:16:50.521966+00:00","updated_at":"2026-05-18T03:16:50.521966+00:00"}