{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NECMDT6FTFNSRHNBMMWMLVL6BU","short_pith_number":"pith:NECMDT6F","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"},"canonical_sha256":"6904c1cfc5995b289da1632cc5d57e0d2670b71f3fdc3f87a5e8e2bbc35c22e6","source":{"kind":"arxiv","id":"2102.03133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.03133","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"2102.03133v2","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03133","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"NECMDT6FTFNS","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"pith_short_16","alias_value":"NECMDT6FTFNSRHNB","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"pith_short_8","alias_value":"NECMDT6F","created_at":"2026-07-05T02:36:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NECMDT6FTFNSRHNBMMWMLVL6BU","target":"record","payload":{"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"},"canonical_sha256":"6904c1cfc5995b289da1632cc5d57e0d2670b71f3fdc3f87a5e8e2bbc35c22e6","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"},"source_kind":"arxiv","source_id":"2102.03133","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1kai3p5DKqZntodFu8E6Tat41tmLuMIJZELPu9A+6USU4S3XiA9rlZuPslibt9RhMWTCzqChHpQ8rXTXvqkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:59:42.694054Z"},"content_sha256":"b198c2a85b35111048aa790b128f0546dfd9b047910db8d3081e640a1471942d","schema_version":"1.0","event_id":"sha256:b198c2a85b35111048aa790b128f0546dfd9b047910db8d3081e640a1471942d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NECMDT6FTFNSRHNBMMWMLVL6BU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SK7GEwGDvybm36oT6AwHT7uePm6w1ltbIQcv4QKI1ueF6ncVVhLCxuf60DJYZJ6xogLcdDC0EgQF0kOpFqnSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:59:42.694932Z"},"content_sha256":"30938c15e8f5f9784bbe64f7901003c8cd5313bb76edfe1fb07637d461846e10","schema_version":"1.0","event_id":"sha256:30938c15e8f5f9784bbe64f7901003c8cd5313bb76edfe1fb07637d461846e10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/bundle.json","state_url":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T14:59:42Z","links":{"resolver":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU","bundle":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/bundle.json","state":"https://pith.science/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NECMDT6FTFNSRHNBMMWMLVL6BU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NECMDT6FTFNSRHNBMMWMLVL6BU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b942025a3e5e865d72a6eb868cd6b06e43868de5055fe7615abfaa316d6d7f60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-05T12:23:11Z","title_canon_sha256":"075eefbef57562e75ccf43fe8e99727dcad2f19c239b04d3c4bbc7ea067d207e"},"schema_version":"1.0","source":{"id":"2102.03133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.03133","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"2102.03133v2","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03133","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"NECMDT6FTFNS","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"pith_short_16","alias_value":"NECMDT6FTFNSRHNB","created_at":"2026-07-05T02:36:03Z"},{"alias_kind":"pith_short_8","alias_value":"NECMDT6F","created_at":"2026-07-05T02:36:03Z"}],"graph_snapshots":[{"event_id":"sha256:30938c15e8f5f9784bbe64f7901003c8cd5313bb76edfe1fb07637d461846e10","target":"graph","created_at":"2026-07-05T02:36:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.03133/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Marc de Visme, Simon Perdrix, Titouan Carette","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-05T12:23:11Z","title":"Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.03133","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b198c2a85b35111048aa790b128f0546dfd9b047910db8d3081e640a1471942d","target":"record","created_at":"2026-07-05T02:36:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b942025a3e5e865d72a6eb868cd6b06e43868de5055fe7615abfaa316d6d7f60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-05T12:23:11Z","title_canon_sha256":"075eefbef57562e75ccf43fe8e99727dcad2f19c239b04d3c4bbc7ea067d207e"},"schema_version":"1.0","source":{"id":"2102.03133","kind":"arxiv","version":2}},"canonical_sha256":"6904c1cfc5995b289da1632cc5d57e0d2670b71f3fdc3f87a5e8e2bbc35c22e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6904c1cfc5995b289da1632cc5d57e0d2670b71f3fdc3f87a5e8e2bbc35c22e6","first_computed_at":"2026-07-05T02:36:03.925581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:03.925581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"auEsr5zXpOa7KDhO/DllJr07UBxPp7+a4WYB/hd8RCKnmUKJcreJ3BkA6UinEZwhgKZDcbepUKl4LiYsocUMAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:03.926059Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.03133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b198c2a85b35111048aa790b128f0546dfd9b047910db8d3081e640a1471942d","sha256:30938c15e8f5f9784bbe64f7901003c8cd5313bb76edfe1fb07637d461846e10"],"state_sha256":"6e1e7b566ff92d81bd63ae7b2b0d519628acea9402d6f0e7c28f8da787a5c47a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkiw9WcJDLROkJ2rej1xvbCc2pkRdHlqQdLUAHPg2FCBGZkPI/fJTK3NdISASjXvJ9S2QbipIEQAEkldE+CMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:59:42.768993Z","bundle_sha256":"e17e6eb2382b98a0c1bce136c15edd0daa16abcdf37723cd31ed85506ec50e8a"}}