{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QRAJXFDFQ24R7CVOMKC6KVNMM4","short_pith_number":"pith:QRAJXFDF","schema_version":"1.0","canonical_sha256":"84409b946586b91f8aae6285e555ac672256f8e05a1e625d061039ca28739fac","source":{"kind":"arxiv","id":"1705.07652","version":2},"attestation_state":"computed","paper":{"title":"Purity through Factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Chris Heunen (University of Edinburgh), Oscar Cunningham (University of Oxford)","submitted_at":"2017-05-22T10:39:20Z","abstract_excerpt":"We give a construction that identifies the collection of pure processes (i.e. those which are deterministic, or without randomness) within a theory containing both pure and mixed processes. Working in the framework of symmetric monoidal categories, we define a pure subcategory. This definition arises elegantly from the categorical notion of a weak factorisation system. Our construction gives the expected result in several examples, both quantum and classical."},"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":"1705.07652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-22T10:39:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0ab49f36624bbbd55182ab8e2ba876bbc073c7bac3730cd4373028c509d4f0c6","abstract_canon_sha256":"e3749126e08d842dfcfab93f5bacecf485d92629756f82231049d0984dfa737a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:10.981546Z","signature_b64":"lFWBInuvaPf0naYGgLbv6ayEKkTygNl+zAIwYr7ASBjgPMwhkcOFfalmfISAfj+UXn8h5QeEuhIo4FO/YQSvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84409b946586b91f8aae6285e555ac672256f8e05a1e625d061039ca28739fac","last_reissued_at":"2026-05-18T00:22:10.980994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:10.980994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Purity through Factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Chris Heunen (University of Edinburgh), Oscar Cunningham (University of Oxford)","submitted_at":"2017-05-22T10:39:20Z","abstract_excerpt":"We give a construction that identifies the collection of pure processes (i.e. those which are deterministic, or without randomness) within a theory containing both pure and mixed processes. Working in the framework of symmetric monoidal categories, we define a pure subcategory. This definition arises elegantly from the categorical notion of a weak factorisation system. Our construction gives the expected result in several examples, both quantum and classical."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07652","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":"1705.07652","created_at":"2026-05-18T00:22:10.981074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07652v2","created_at":"2026-05-18T00:22:10.981074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07652","created_at":"2026-05-18T00:22:10.981074+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRAJXFDFQ24R","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRAJXFDFQ24R7CVO","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRAJXFDF","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07021","citing_title":"A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4","json":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4.json","graph_json":"https://pith.science/api/pith-number/QRAJXFDFQ24R7CVOMKC6KVNMM4/graph.json","events_json":"https://pith.science/api/pith-number/QRAJXFDFQ24R7CVOMKC6KVNMM4/events.json","paper":"https://pith.science/paper/QRAJXFDF"},"agent_actions":{"view_html":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4","download_json":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4.json","view_paper":"https://pith.science/paper/QRAJXFDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07652&json=true","fetch_graph":"https://pith.science/api/pith-number/QRAJXFDFQ24R7CVOMKC6KVNMM4/graph.json","fetch_events":"https://pith.science/api/pith-number/QRAJXFDFQ24R7CVOMKC6KVNMM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4/action/storage_attestation","attest_author":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4/action/author_attestation","sign_citation":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4/action/citation_signature","submit_replication":"https://pith.science/pith/QRAJXFDFQ24R7CVOMKC6KVNMM4/action/replication_record"}},"created_at":"2026-05-18T00:22:10.981074+00:00","updated_at":"2026-05-18T00:22:10.981074+00:00"}