{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4ST3YIPDHRQRXJMRUK2PXLORII","short_pith_number":"pith:4ST3YIPD","canonical_record":{"source":{"id":"1901.02173","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-08T06:43:03Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d3d31a359fb828b5244f550711a447c8bef115ee96f84d7644466f248a8a221a","abstract_canon_sha256":"a454cc44bd5c84d2b99d0ff09bdda70a086f2ebd02d263e026edd3c3f1de6ba6"},"schema_version":"1.0"},"canonical_sha256":"e4a7bc21e33c611ba591a2b4fbadd14227873841d0c7d937d6c7f1a94e9cdf10","source":{"kind":"arxiv","id":"1901.02173","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02173","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02173v3","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02173","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"4ST3YIPDHRQR","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"4ST3YIPDHRQRXJMR","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"4ST3YIPD","created_at":"2026-07-05T04:55:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4ST3YIPDHRQRXJMRUK2PXLORII","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02173","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-08T06:43:03Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d3d31a359fb828b5244f550711a447c8bef115ee96f84d7644466f248a8a221a","abstract_canon_sha256":"a454cc44bd5c84d2b99d0ff09bdda70a086f2ebd02d263e026edd3c3f1de6ba6"},"schema_version":"1.0"},"canonical_sha256":"e4a7bc21e33c611ba591a2b4fbadd14227873841d0c7d937d6c7f1a94e9cdf10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:59.723216Z","signature_b64":"wbwOSlu3uX+mqYvRcySPdB4WFgQRqgUW3jHhq+XdN6iQCGPA/V1Ipsx+Epnr2mU8POL5zad7xh34iBzS+dTbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a7bc21e33c611ba591a2b4fbadd14227873841d0c7d937d6c7f1a94e9cdf10","last_reissued_at":"2026-07-05T04:55:59.722829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:59.722829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02173","source_version":3,"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-05T04:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcgsgP0ROzlUEecmBjbHBqKy3Ce+O/Zjz2RC94nos3/lhSkDQf+mrlyk/Ijmo+Pxqqaq/YxB6Z5HLMIvvzVGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:38:56.520579Z"},"content_sha256":"df11c8d137f399f424d5b93ead9afc660632c578dcf50f68a630a9f6e37d2808","schema_version":"1.0","event_id":"sha256:df11c8d137f399f424d5b93ead9afc660632c578dcf50f68a630a9f6e37d2808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4ST3YIPDHRQRXJMRUK2PXLORII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivalence Checking of Quantum Finite-State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.FL","authors_text":"Junyi Liu, Mingsheng Ying, Qisheng Wang","submitted_at":"2019-01-08T06:43:03Z","abstract_excerpt":"In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits. Moreover, the minimisation problem is proved to be in $\\textbf{PSPACE}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02173","kind":"arxiv","version":3},"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/1901.02173/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-05T04:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAZHiZmd8+PJA0yo8A2W0KZUKuZ+12WEbTBUr/6S2Pna5/vmm18/HTmdy99jpcSCzIxteBrVusjGXMMOy6CzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:38:56.520957Z"},"content_sha256":"0f903fdc324508a64ca7c1be727b287235fbca413ed48798d82c5968b3e2e716","schema_version":"1.0","event_id":"sha256:0f903fdc324508a64ca7c1be727b287235fbca413ed48798d82c5968b3e2e716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ST3YIPDHRQRXJMRUK2PXLORII/bundle.json","state_url":"https://pith.science/pith/4ST3YIPDHRQRXJMRUK2PXLORII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ST3YIPDHRQRXJMRUK2PXLORII/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-04T13:38:56Z","links":{"resolver":"https://pith.science/pith/4ST3YIPDHRQRXJMRUK2PXLORII","bundle":"https://pith.science/pith/4ST3YIPDHRQRXJMRUK2PXLORII/bundle.json","state":"https://pith.science/pith/4ST3YIPDHRQRXJMRUK2PXLORII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ST3YIPDHRQRXJMRUK2PXLORII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4ST3YIPDHRQRXJMRUK2PXLORII","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":"a454cc44bd5c84d2b99d0ff09bdda70a086f2ebd02d263e026edd3c3f1de6ba6","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-08T06:43:03Z","title_canon_sha256":"d3d31a359fb828b5244f550711a447c8bef115ee96f84d7644466f248a8a221a"},"schema_version":"1.0","source":{"id":"1901.02173","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02173","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02173v3","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02173","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"4ST3YIPDHRQR","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"4ST3YIPDHRQRXJMR","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"4ST3YIPD","created_at":"2026-07-05T04:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:0f903fdc324508a64ca7c1be727b287235fbca413ed48798d82c5968b3e2e716","target":"graph","created_at":"2026-07-05T04:55:59Z","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/1901.02173/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits. Moreover, the minimisation problem is proved to be in $\\textbf{PSPACE}$.","authors_text":"Junyi Liu, Mingsheng Ying, Qisheng Wang","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-08T06:43:03Z","title":"Equivalence Checking of Quantum Finite-State Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02173","kind":"arxiv","version":3},"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:df11c8d137f399f424d5b93ead9afc660632c578dcf50f68a630a9f6e37d2808","target":"record","created_at":"2026-07-05T04:55:59Z","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":"a454cc44bd5c84d2b99d0ff09bdda70a086f2ebd02d263e026edd3c3f1de6ba6","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-08T06:43:03Z","title_canon_sha256":"d3d31a359fb828b5244f550711a447c8bef115ee96f84d7644466f248a8a221a"},"schema_version":"1.0","source":{"id":"1901.02173","kind":"arxiv","version":3}},"canonical_sha256":"e4a7bc21e33c611ba591a2b4fbadd14227873841d0c7d937d6c7f1a94e9cdf10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4a7bc21e33c611ba591a2b4fbadd14227873841d0c7d937d6c7f1a94e9cdf10","first_computed_at":"2026-07-05T04:55:59.722829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:55:59.722829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbwOSlu3uX+mqYvRcySPdB4WFgQRqgUW3jHhq+XdN6iQCGPA/V1Ipsx+Epnr2mU8POL5zad7xh34iBzS+dTbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:55:59.723216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02173","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df11c8d137f399f424d5b93ead9afc660632c578dcf50f68a630a9f6e37d2808","sha256:0f903fdc324508a64ca7c1be727b287235fbca413ed48798d82c5968b3e2e716"],"state_sha256":"12edb8bb10920049589b17050f98153bff885437522d74a8f7ceb216559cb7bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VWIGltAqyqLIlecTssgo0/QkzHAq9+qGAXJ2L/nzXr04bJoNfAIVi3vBwEChgAg7nZ9oZRXRDsgmsMDfuKDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:38:56.523632Z","bundle_sha256":"3a271713b5e18087df3a84c1b6eadd4711a45eaa1f1f9e8896ed0941aad99e6f"}}