{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NQJSFNQBIBKCEL7RSIISW6AOJ4","short_pith_number":"pith:NQJSFNQB","schema_version":"1.0","canonical_sha256":"6c1322b6014054222ff192112b780e4f3b94c9685470212fac046b6887a1427f","source":{"kind":"arxiv","id":"1010.4111","version":2},"attestation_state":"computed","paper":{"title":"Quick cut-elimination for strictly positive cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Toshiyasu Arai","submitted_at":"2010-10-20T06:54:14Z","abstract_excerpt":"In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of the Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic."},"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":"1010.4111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-10-20T06:54:14Z","cross_cats_sorted":[],"title_canon_sha256":"25967fd284e936b7fa5ac9c1c90deecd288118ea927bbd1519666239dac44923","abstract_canon_sha256":"329d25ed4ea302c5d9883d027588715c72d79b97efadc71624ed65ec10d91de9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:30.852804Z","signature_b64":"YoruEBbnmQDzIOBBE6SqyS7GcdNCTQ3qZdGc1BfFI8N9SWdPwHv0Msb4nHM8jKY2eH0niabR3UNhWc+wpBFdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1322b6014054222ff192112b780e4f3b94c9685470212fac046b6887a1427f","last_reissued_at":"2026-05-18T03:28:30.851922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:30.851922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quick cut-elimination for strictly positive cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Toshiyasu Arai","submitted_at":"2010-10-20T06:54:14Z","abstract_excerpt":"In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of the Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4111","kind":"arxiv","version":2},"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":"1010.4111","created_at":"2026-05-18T03:28:30.852048+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4111v2","created_at":"2026-05-18T03:28:30.852048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4111","created_at":"2026-05-18T03:28:30.852048+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQJSFNQBIBKC","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQJSFNQBIBKCEL7R","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQJSFNQB","created_at":"2026-05-18T12:26:10.704358+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/NQJSFNQBIBKCEL7RSIISW6AOJ4","json":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4.json","graph_json":"https://pith.science/api/pith-number/NQJSFNQBIBKCEL7RSIISW6AOJ4/graph.json","events_json":"https://pith.science/api/pith-number/NQJSFNQBIBKCEL7RSIISW6AOJ4/events.json","paper":"https://pith.science/paper/NQJSFNQB"},"agent_actions":{"view_html":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4","download_json":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4.json","view_paper":"https://pith.science/paper/NQJSFNQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4111&json=true","fetch_graph":"https://pith.science/api/pith-number/NQJSFNQBIBKCEL7RSIISW6AOJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/NQJSFNQBIBKCEL7RSIISW6AOJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4/action/storage_attestation","attest_author":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4/action/author_attestation","sign_citation":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4/action/citation_signature","submit_replication":"https://pith.science/pith/NQJSFNQBIBKCEL7RSIISW6AOJ4/action/replication_record"}},"created_at":"2026-05-18T03:28:30.852048+00:00","updated_at":"2026-05-18T03:28:30.852048+00:00"}