{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:YOROID2MSLV7BXC4PI3CI3O2XI","short_pith_number":"pith:YOROID2M","schema_version":"1.0","canonical_sha256":"c3a2e40f4c92ebf0dc5c7a36246ddaba33ac4c8f2a7b5341ab8ad59981ddeeea","source":{"kind":"arxiv","id":"quant-ph/0512114","version":1},"attestation_state":"computed","paper":{"title":"A Categorical Quantum Logic","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Ross Duncan, Samson Abramsky","submitted_at":"2005-12-15T03:37:38Z","abstract_excerpt":"We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax can be used to represent and reason about quantum processes."},"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":"quant-ph/0512114","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-12-15T03:37:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0f1a165033e9c2b46d3e56475970fb73f32808de3f7b43546bd8572b8c805e23","abstract_canon_sha256":"e9cb9ab6e343a2de9e09bacb0d87fe6c6a17f16e89f5a23964b5beda1f7524ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:33.349204Z","signature_b64":"rr9gWiya6DFqd5G7zu6FBKcnjpwpj2YV8DGU6J7LC08m8zGOlO3iua1NrLfnc9Y3ZjflSkT+y6NOQrJ84zoUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a2e40f4c92ebf0dc5c7a36246ddaba33ac4c8f2a7b5341ab8ad59981ddeeea","last_reissued_at":"2026-05-18T03:20:33.348241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:33.348241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Categorical Quantum Logic","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Ross Duncan, Samson Abramsky","submitted_at":"2005-12-15T03:37:38Z","abstract_excerpt":"We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax can be used to represent and reason about quantum processes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0512114","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":"quant-ph/0512114","created_at":"2026-05-18T03:20:33.348409+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0512114v1","created_at":"2026-05-18T03:20:33.348409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0512114","created_at":"2026-05-18T03:20:33.348409+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOROID2MSLV7","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOROID2MSLV7BXC4","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOROID2M","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2309.07245","citing_title":"Entanglement of Sections: The pushout of entangled and parameterized quantum information","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI","json":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI.json","graph_json":"https://pith.science/api/pith-number/YOROID2MSLV7BXC4PI3CI3O2XI/graph.json","events_json":"https://pith.science/api/pith-number/YOROID2MSLV7BXC4PI3CI3O2XI/events.json","paper":"https://pith.science/paper/YOROID2M"},"agent_actions":{"view_html":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI","download_json":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI.json","view_paper":"https://pith.science/paper/YOROID2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0512114&json=true","fetch_graph":"https://pith.science/api/pith-number/YOROID2MSLV7BXC4PI3CI3O2XI/graph.json","fetch_events":"https://pith.science/api/pith-number/YOROID2MSLV7BXC4PI3CI3O2XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI/action/storage_attestation","attest_author":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI/action/author_attestation","sign_citation":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI/action/citation_signature","submit_replication":"https://pith.science/pith/YOROID2MSLV7BXC4PI3CI3O2XI/action/replication_record"}},"created_at":"2026-05-18T03:20:33.348409+00:00","updated_at":"2026-05-18T03:20:33.348409+00:00"}