{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GRFIKVNMET2HXYBGHPFJF42ZPN","short_pith_number":"pith:GRFIKVNM","schema_version":"1.0","canonical_sha256":"344a8555ac24f47be0263bca92f3597b6bceef4391930176cf9bed3a48aa04b6","source":{"kind":"arxiv","id":"1401.4002","version":1},"attestation_state":"computed","paper":{"title":"Circular Proofs for G\\\"odel-L\\\"ob Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Daniyar Shamkanov","submitted_at":"2014-01-16T12:06:40Z","abstract_excerpt":"We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish Lindon interpolation for GL syntactically."},"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":"1401.4002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-01-16T12:06:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8bdecab196f35e1e88cdd95f63a2a3cf804fe21fbd25f53dfd7025c1c5a839b6","abstract_canon_sha256":"5c80026f641e6c9d19dbbbade4928c071547ec239d45d974ce76f0cf30225e15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:15.750152Z","signature_b64":"UlAEQ+RnxjMMjPFVRJWU7h36QHMk2kxtb+0h0wr6DhHG6j7CMPH1EfzVNiLgHmUbcZ3yKQW9o5dnD71x+O43Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"344a8555ac24f47be0263bca92f3597b6bceef4391930176cf9bed3a48aa04b6","last_reissued_at":"2026-05-18T02:30:15.749752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:15.749752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular Proofs for G\\\"odel-L\\\"ob Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Daniyar Shamkanov","submitted_at":"2014-01-16T12:06:40Z","abstract_excerpt":"We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish Lindon interpolation for GL syntactically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4002","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":"1401.4002","created_at":"2026-05-18T02:30:15.749816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4002v1","created_at":"2026-05-18T02:30:15.749816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4002","created_at":"2026-05-18T02:30:15.749816+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRFIKVNMET2H","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRFIKVNMET2HXYBG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRFIKVNM","created_at":"2026-05-18T12:28:30.664211+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/GRFIKVNMET2HXYBGHPFJF42ZPN","json":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN.json","graph_json":"https://pith.science/api/pith-number/GRFIKVNMET2HXYBGHPFJF42ZPN/graph.json","events_json":"https://pith.science/api/pith-number/GRFIKVNMET2HXYBGHPFJF42ZPN/events.json","paper":"https://pith.science/paper/GRFIKVNM"},"agent_actions":{"view_html":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN","download_json":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN.json","view_paper":"https://pith.science/paper/GRFIKVNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4002&json=true","fetch_graph":"https://pith.science/api/pith-number/GRFIKVNMET2HXYBGHPFJF42ZPN/graph.json","fetch_events":"https://pith.science/api/pith-number/GRFIKVNMET2HXYBGHPFJF42ZPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN/action/storage_attestation","attest_author":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN/action/author_attestation","sign_citation":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN/action/citation_signature","submit_replication":"https://pith.science/pith/GRFIKVNMET2HXYBGHPFJF42ZPN/action/replication_record"}},"created_at":"2026-05-18T02:30:15.749816+00:00","updated_at":"2026-05-18T02:30:15.749816+00:00"}