{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WN6QPYRXG2N6HNUGOGEF2TTUKO","short_pith_number":"pith:WN6QPYRX","canonical_record":{"source":{"id":"2109.02115","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-05T16:22:55Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"4e2b136bc295f727d11fb09f4235d3e8f43b44380085c06e75718f56739a91e7","abstract_canon_sha256":"b5e6eafd31b21f6c81389c89b0f4b8e4e1bf0fd2dc76fae25dfc9b6614332f7b"},"schema_version":"1.0"},"canonical_sha256":"b37d07e237369be3b68671885d4e7453bb0424457539bd4d222905b920dbb4db","source":{"kind":"arxiv","id":"2109.02115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.02115","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"2109.02115v1","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02115","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"WN6QPYRXG2N6","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"pith_short_16","alias_value":"WN6QPYRXG2N6HNUG","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"pith_short_8","alias_value":"WN6QPYRX","created_at":"2026-07-05T03:11:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WN6QPYRXG2N6HNUGOGEF2TTUKO","target":"record","payload":{"canonical_record":{"source":{"id":"2109.02115","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-05T16:22:55Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"4e2b136bc295f727d11fb09f4235d3e8f43b44380085c06e75718f56739a91e7","abstract_canon_sha256":"b5e6eafd31b21f6c81389c89b0f4b8e4e1bf0fd2dc76fae25dfc9b6614332f7b"},"schema_version":"1.0"},"canonical_sha256":"b37d07e237369be3b68671885d4e7453bb0424457539bd4d222905b920dbb4db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:39.181731Z","signature_b64":"IKQfhJQnH7LchSyIvBxXLy4Orc3+8E4hsF9/ywrhVJzfLu+ErLX2D38fahKR3qM5vVmoCC9803fr5z2YBHICDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37d07e237369be3b68671885d4e7453bb0424457539bd4d222905b920dbb4db","last_reissued_at":"2026-07-05T03:11:39.181254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:39.181254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.02115","source_version":1,"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-05T03:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOiDWdQqVbj5uLaTSDyaEG1mYbIQNBqg0F2r/0mSIdKWI5YATvs8fSIxys936DcNQjOtsbmdifxRCyRwgL2DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:03:57.250533Z"},"content_sha256":"5e6782816dc016cdb35348625c320d7929e51e083f6eafbfaaa3ae54eca6da63","schema_version":"1.0","event_id":"sha256:5e6782816dc016cdb35348625c320d7929e51e083f6eafbfaaa3ae54eca6da63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WN6QPYRXG2N6HNUGOGEF2TTUKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the query complexity of connectivity with global queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Arinta Auza, Troy Lee","submitted_at":"2021-09-05T16:22:55Z","abstract_excerpt":"We study the query complexity of determining if a graph is connected with global queries. The first model we look at is matrix-vector multiplication queries to the adjacency matrix. Here, for an $n$-vertex graph with adjacency matrix $A$, one can query a vector $x \\in \\{0,1\\}^n$ and receive the answer $Ax$. We give a randomized algorithm that can output a spanning forest of a weighted graph with constant probability after $O(\\log^4(n))$ matrix-vector multiplication queries to the adjacency matrix. This complements a result of Sun et al.\\ (ICALP 2019) that gives a randomized algorithm that can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02115","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.02115/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-05T03:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYws8ojxhy0Y9wflWMtKIHiElr+LoEGyym3iTlZJp8gj0YHoWtW6jqCU8IuPFmlne/OdgHrT2AmEe2cNBu2qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:03:57.251091Z"},"content_sha256":"1c77669bac420add1c39676246697302a8fe10b3ac8ea6043103ae627a21ca65","schema_version":"1.0","event_id":"sha256:1c77669bac420add1c39676246697302a8fe10b3ac8ea6043103ae627a21ca65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO/bundle.json","state_url":"https://pith.science/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO/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-08T04:03:57Z","links":{"resolver":"https://pith.science/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO","bundle":"https://pith.science/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO/bundle.json","state":"https://pith.science/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WN6QPYRXG2N6HNUGOGEF2TTUKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WN6QPYRXG2N6HNUGOGEF2TTUKO","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":"b5e6eafd31b21f6c81389c89b0f4b8e4e1bf0fd2dc76fae25dfc9b6614332f7b","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-05T16:22:55Z","title_canon_sha256":"4e2b136bc295f727d11fb09f4235d3e8f43b44380085c06e75718f56739a91e7"},"schema_version":"1.0","source":{"id":"2109.02115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.02115","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"2109.02115v1","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02115","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"WN6QPYRXG2N6","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"pith_short_16","alias_value":"WN6QPYRXG2N6HNUG","created_at":"2026-07-05T03:11:39Z"},{"alias_kind":"pith_short_8","alias_value":"WN6QPYRX","created_at":"2026-07-05T03:11:39Z"}],"graph_snapshots":[{"event_id":"sha256:1c77669bac420add1c39676246697302a8fe10b3ac8ea6043103ae627a21ca65","target":"graph","created_at":"2026-07-05T03:11:39Z","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/2109.02115/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the query complexity of determining if a graph is connected with global queries. The first model we look at is matrix-vector multiplication queries to the adjacency matrix. Here, for an $n$-vertex graph with adjacency matrix $A$, one can query a vector $x \\in \\{0,1\\}^n$ and receive the answer $Ax$. We give a randomized algorithm that can output a spanning forest of a weighted graph with constant probability after $O(\\log^4(n))$ matrix-vector multiplication queries to the adjacency matrix. This complements a result of Sun et al.\\ (ICALP 2019) that gives a randomized algorithm that can ","authors_text":"Arinta Auza, Troy Lee","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-05T16:22:55Z","title":"On the query complexity of connectivity with global queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02115","kind":"arxiv","version":1},"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:5e6782816dc016cdb35348625c320d7929e51e083f6eafbfaaa3ae54eca6da63","target":"record","created_at":"2026-07-05T03:11:39Z","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":"b5e6eafd31b21f6c81389c89b0f4b8e4e1bf0fd2dc76fae25dfc9b6614332f7b","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-05T16:22:55Z","title_canon_sha256":"4e2b136bc295f727d11fb09f4235d3e8f43b44380085c06e75718f56739a91e7"},"schema_version":"1.0","source":{"id":"2109.02115","kind":"arxiv","version":1}},"canonical_sha256":"b37d07e237369be3b68671885d4e7453bb0424457539bd4d222905b920dbb4db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b37d07e237369be3b68671885d4e7453bb0424457539bd4d222905b920dbb4db","first_computed_at":"2026-07-05T03:11:39.181254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:39.181254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKQfhJQnH7LchSyIvBxXLy4Orc3+8E4hsF9/ywrhVJzfLu+ErLX2D38fahKR3qM5vVmoCC9803fr5z2YBHICDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:39.181731Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.02115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e6782816dc016cdb35348625c320d7929e51e083f6eafbfaaa3ae54eca6da63","sha256:1c77669bac420add1c39676246697302a8fe10b3ac8ea6043103ae627a21ca65"],"state_sha256":"1567a7a8119ce6dcaa22f2295f99fc5baebea2fcf8761de31cb74733197107e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/alUWOEwFjQ3Fsa64BRi8DBp0pCnA38w3gLHm7JqAP8ksr4ffX733ddMvlr/T0FHETl80TmqMS/otiwkz7fFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:03:57.255467Z","bundle_sha256":"bad8e79100f809fe6b0f63ee86f980c3e92b97adcd4bbc28336a904396cfba3d"}}