{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XMUFE2QT47HEJCVVKSYBWNZ7OU","short_pith_number":"pith:XMUFE2QT","schema_version":"1.0","canonical_sha256":"bb28526a13e7ce448ab554b01b373f753bf5cd40e1201b6a4728921c11331eef","source":{"kind":"arxiv","id":"1610.00581","version":1},"attestation_state":"computed","paper":{"title":"Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Ashley Montanaro, Chris Cade","submitted_at":"2016-10-03T15:10:05Z","abstract_excerpt":"We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in $\\tilde{O}(n^{3/2})$ time and using $O(\\log n)$ classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorithms for deciding the two properties in the adjacency array model, which run in time $\\tilde{O}(n\\sqrt{d_m})$ and also require $O(\\log n)$ space, where $d_m$ is the maximum degree of "},"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":"1610.00581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-03T15:10:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cf58948e13c26f2c530c0710f8a01a14046a90fc0db45b6302ae3c2871f39702","abstract_canon_sha256":"5344bbada2578fe20a4dd4e71a40d2510044687fdaf236481589c7c2692389ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:25.181740Z","signature_b64":"aP2/yBvipmBYQJGcTLSbjMovuFuQWuEQxcG7zjxlUTHhJhkNgFFu536+ynOUgea2SLQEjN69vWXGpklqtB+3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb28526a13e7ce448ab554b01b373f753bf5cd40e1201b6a4728921c11331eef","last_reissued_at":"2026-05-18T01:03:25.181262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:25.181262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Ashley Montanaro, Chris Cade","submitted_at":"2016-10-03T15:10:05Z","abstract_excerpt":"We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in $\\tilde{O}(n^{3/2})$ time and using $O(\\log n)$ classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorithms for deciding the two properties in the adjacency array model, which run in time $\\tilde{O}(n\\sqrt{d_m})$ and also require $O(\\log n)$ space, where $d_m$ is the maximum degree of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00581","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":"1610.00581","created_at":"2026-05-18T01:03:25.181335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00581v1","created_at":"2026-05-18T01:03:25.181335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00581","created_at":"2026-05-18T01:03:25.181335+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMUFE2QT47HE","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMUFE2QT47HEJCVV","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMUFE2QT","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00446","citing_title":"Identifying vulnerable nodes and detecting malicious entanglement patterns to handle st-connectivity attacks in quantum networks","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU","json":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU.json","graph_json":"https://pith.science/api/pith-number/XMUFE2QT47HEJCVVKSYBWNZ7OU/graph.json","events_json":"https://pith.science/api/pith-number/XMUFE2QT47HEJCVVKSYBWNZ7OU/events.json","paper":"https://pith.science/paper/XMUFE2QT"},"agent_actions":{"view_html":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU","download_json":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU.json","view_paper":"https://pith.science/paper/XMUFE2QT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00581&json=true","fetch_graph":"https://pith.science/api/pith-number/XMUFE2QT47HEJCVVKSYBWNZ7OU/graph.json","fetch_events":"https://pith.science/api/pith-number/XMUFE2QT47HEJCVVKSYBWNZ7OU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU/action/storage_attestation","attest_author":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU/action/author_attestation","sign_citation":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU/action/citation_signature","submit_replication":"https://pith.science/pith/XMUFE2QT47HEJCVVKSYBWNZ7OU/action/replication_record"}},"created_at":"2026-05-18T01:03:25.181335+00:00","updated_at":"2026-05-18T01:03:25.181335+00:00"}