{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UZE6FN6PLV2UHLAWZTWYYHRHHD","short_pith_number":"pith:UZE6FN6P","schema_version":"1.0","canonical_sha256":"a649e2b7cf5d7543ac16cced8c1e2738ceec86722721af3170c358009ab242f3","source":{"kind":"arxiv","id":"1207.1188","version":1},"attestation_state":"computed","paper":{"title":"On the toggling-branching recurrence of Computability Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daming Zhu, Junfeng Luan, Meixia Qu","submitted_at":"2012-07-05T08:28:41Z","abstract_excerpt":"We introduce a new, substantially simplified version of the toggling-branching recurrence operation of Computability Logic, prove its equivalence to Japaridze's old, \"canonical\" version, and also prove that both versions preserve the static property of their arguments."},"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":"1207.1188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-05T08:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"5dbd02af7e4011ef2304b6ea9b144ac4f719e80308145d578208ef3e876b3091","abstract_canon_sha256":"2a3a15dba7862c0a22dd5f0f98951d0cc3bfc5c4934845060744317859ecb27c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:46.660972Z","signature_b64":"H9YmqHYXkb5Iko/XCfsdw9zbu89NZSUzfrW7ND+oVtdfmT2frEOQGyCwaWOODPSqxu7dYO/Qb7iO6JELvN6BBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a649e2b7cf5d7543ac16cced8c1e2738ceec86722721af3170c358009ab242f3","last_reissued_at":"2026-05-18T03:51:46.660404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:46.660404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the toggling-branching recurrence of Computability Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daming Zhu, Junfeng Luan, Meixia Qu","submitted_at":"2012-07-05T08:28:41Z","abstract_excerpt":"We introduce a new, substantially simplified version of the toggling-branching recurrence operation of Computability Logic, prove its equivalence to Japaridze's old, \"canonical\" version, and also prove that both versions preserve the static property of their arguments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1188","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":"1207.1188","created_at":"2026-05-18T03:51:46.660497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1188v1","created_at":"2026-05-18T03:51:46.660497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1188","created_at":"2026-05-18T03:51:46.660497+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZE6FN6PLV2U","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZE6FN6PLV2UHLAW","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZE6FN6P","created_at":"2026-05-18T12:27:25.539911+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/UZE6FN6PLV2UHLAWZTWYYHRHHD","json":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD.json","graph_json":"https://pith.science/api/pith-number/UZE6FN6PLV2UHLAWZTWYYHRHHD/graph.json","events_json":"https://pith.science/api/pith-number/UZE6FN6PLV2UHLAWZTWYYHRHHD/events.json","paper":"https://pith.science/paper/UZE6FN6P"},"agent_actions":{"view_html":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD","download_json":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD.json","view_paper":"https://pith.science/paper/UZE6FN6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1188&json=true","fetch_graph":"https://pith.science/api/pith-number/UZE6FN6PLV2UHLAWZTWYYHRHHD/graph.json","fetch_events":"https://pith.science/api/pith-number/UZE6FN6PLV2UHLAWZTWYYHRHHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD/action/storage_attestation","attest_author":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD/action/author_attestation","sign_citation":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD/action/citation_signature","submit_replication":"https://pith.science/pith/UZE6FN6PLV2UHLAWZTWYYHRHHD/action/replication_record"}},"created_at":"2026-05-18T03:51:46.660497+00:00","updated_at":"2026-05-18T03:51:46.660497+00:00"}