{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IZ7VQKFU3S772DAB66YQ2WHJIS","short_pith_number":"pith:IZ7VQKFU","schema_version":"1.0","canonical_sha256":"467f5828b4dcbffd0c01f7b10d58e944a21174e1ab3755b8c4c742697c2c2aaf","source":{"kind":"arxiv","id":"2501.12007","version":1},"attestation_state":"computed","paper":{"title":"Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"quant-ph","authors_text":"Tomoyuki Yamakami","submitted_at":"2025-01-21T09:58:59Z","abstract_excerpt":"We introduce a quantum analogue of classical first-order logic (FO) and develop a theory of quantum first-order logic as a basis of the productive discussions on the power of logical expressiveness toward quantum computing. The purpose of this work is to logically express \"quantum computation\" by introducing specially-featured quantum connectives and quantum quantifiers that quantify fixed-dimensional quantum states. Our approach is founded on the recently introduced recursion-theoretical schematic definitions of time-bounded quantum functions, which map finite-dimensional Hilbert spaces to th"},"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":"2501.12007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-21T09:58:59Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"6bab83cc3af77c3b7206e2dd1c2c37087317e8c3f1dfba405f01b28d4759b8bf","abstract_canon_sha256":"e6c7d41d4d83790fd60cf1aceba3f90d271afcab78c6ca933be64ec023871a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:17.381545Z","signature_b64":"9JcjzHAzKKNOtWu6FKNqYhb98LGvNHTGaNe4yWyGacRr1Q/roKXd+L0xbpMNNxhnu8GVjD+vEAhB88pzQtgADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467f5828b4dcbffd0c01f7b10d58e944a21174e1ab3755b8c4c742697c2c2aaf","last_reissued_at":"2026-07-05T10:03:17.381076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:17.381076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"quant-ph","authors_text":"Tomoyuki Yamakami","submitted_at":"2025-01-21T09:58:59Z","abstract_excerpt":"We introduce a quantum analogue of classical first-order logic (FO) and develop a theory of quantum first-order logic as a basis of the productive discussions on the power of logical expressiveness toward quantum computing. The purpose of this work is to logically express \"quantum computation\" by introducing specially-featured quantum connectives and quantum quantifiers that quantify fixed-dimensional quantum states. Our approach is founded on the recently introduced recursion-theoretical schematic definitions of time-bounded quantum functions, which map finite-dimensional Hilbert spaces to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.12007/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.12007","created_at":"2026-07-05T10:03:17.381136+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12007v1","created_at":"2026-07-05T10:03:17.381136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12007","created_at":"2026-07-05T10:03:17.381136+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZ7VQKFU3S77","created_at":"2026-07-05T10:03:17.381136+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZ7VQKFU3S772DAB","created_at":"2026-07-05T10:03:17.381136+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZ7VQKFU","created_at":"2026-07-05T10:03:17.381136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16272","citing_title":"VEFX-Bench: A Holistic Benchmark for Generic Video Editing and Visual Effects","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS","json":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS.json","graph_json":"https://pith.science/api/pith-number/IZ7VQKFU3S772DAB66YQ2WHJIS/graph.json","events_json":"https://pith.science/api/pith-number/IZ7VQKFU3S772DAB66YQ2WHJIS/events.json","paper":"https://pith.science/paper/IZ7VQKFU"},"agent_actions":{"view_html":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS","download_json":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS.json","view_paper":"https://pith.science/paper/IZ7VQKFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12007&json=true","fetch_graph":"https://pith.science/api/pith-number/IZ7VQKFU3S772DAB66YQ2WHJIS/graph.json","fetch_events":"https://pith.science/api/pith-number/IZ7VQKFU3S772DAB66YQ2WHJIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS/action/storage_attestation","attest_author":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS/action/author_attestation","sign_citation":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS/action/citation_signature","submit_replication":"https://pith.science/pith/IZ7VQKFU3S772DAB66YQ2WHJIS/action/replication_record"}},"created_at":"2026-07-05T10:03:17.381136+00:00","updated_at":"2026-07-05T10:03:17.381136+00:00"}