{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NECMDT6FTFNSRHNBMMWMLVL6BU","short_pith_number":"pith:NECMDT6F","schema_version":"1.0","canonical_sha256":"6904c1cfc5995b289da1632cc5d57e0d2670b71f3fdc3f87a5e8e2bbc35c22e6","source":{"kind":"arxiv","id":"2102.03133","version":2},"attestation_state":"computed","paper":{"title":"Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marc de Visme, Simon Perdrix, Titouan Carette","submitted_at":"2021-02-05T12:23:11Z","abstract_excerpt":"Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for p"},"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":"2102.03133","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-05T12:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"075eefbef57562e75ccf43fe8e99727dcad2f19c239b04d3c4bbc7ea067d207e","abstract_canon_sha256":"b942025a3e5e865d72a6eb868cd6b06e43868de5055fe7615abfaa316d6d7f60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:03.926059Z","signature_b64":"auEsr5zXpOa7KDhO/DllJr07UBxPp7+a4WYB/hd8RCKnmUKJcreJ3BkA6UinEZwhgKZDcbepUKl4LiYsocUMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6904c1cfc5995b289da1632cc5d57e0d2670b71f3fdc3f87a5e8e2bbc35c22e6","last_reissued_at":"2026-07-05T02:36:03.925581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:03.925581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marc de Visme, Simon Perdrix, Titouan Carette","submitted_at":"2021-02-05T12:23:11Z","abstract_excerpt":"Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.03133","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.03133/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":"2102.03133","created_at":"2026-07-05T02:36:03.925652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.03133v2","created_at":"2026-07-05T02:36:03.925652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03133","created_at":"2026-07-05T02:36:03.925652+00:00"},{"alias_kind":"pith_short_12","alias_value":"NECMDT6FTFNS","created_at":"2026-07-05T02:36:03.925652+00:00"},{"alias_kind":"pith_short_16","alias_value":"NECMDT6FTFNSRHNB","created_at":"2026-07-05T02:36:03.925652+00:00"},{"alias_kind":"pith_short_8","alias_value":"NECMDT6F","created_at":"2026-07-05T02:36:03.925652+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.03996","citing_title":"Finite Observations, Infinite Behaviour: bicategorical semantics for stateful monoidal processes","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU","json":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU.json","graph_json":"https://pith.science/api/pith-number/NECMDT6FTFNSRHNBMMWMLVL6BU/graph.json","events_json":"https://pith.science/api/pith-number/NECMDT6FTFNSRHNBMMWMLVL6BU/events.json","paper":"https://pith.science/paper/NECMDT6F"},"agent_actions":{"view_html":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU","download_json":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU.json","view_paper":"https://pith.science/paper/NECMDT6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.03133&json=true","fetch_graph":"https://pith.science/api/pith-number/NECMDT6FTFNSRHNBMMWMLVL6BU/graph.json","fetch_events":"https://pith.science/api/pith-number/NECMDT6FTFNSRHNBMMWMLVL6BU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/action/storage_attestation","attest_author":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/action/author_attestation","sign_citation":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/action/citation_signature","submit_replication":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/action/replication_record"}},"created_at":"2026-07-05T02:36:03.925652+00:00","updated_at":"2026-07-05T02:36:03.925652+00:00"}