{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EMSMFZ5JS42FEOG622DKNA5WAY","short_pith_number":"pith:EMSMFZ5J","canonical_record":{"source":{"id":"2606.13583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T17:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"cc570e2c49ca4088b1830bfa3718671cbb808225f3646861852dc49b97e57d6c","abstract_canon_sha256":"444fc559a6798426e66d603b2cf72fe4e200a77aec9798ff8b3b8a3ef09458e8"},"schema_version":"1.0"},"canonical_sha256":"2324c2e7a997345238ded686a683b60606cf9ffa5f25640c1a312aecb1cdc30f","source":{"kind":"arxiv","id":"2606.13583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13583","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13583v1","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13583","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"EMSMFZ5JS42F","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_16","alias_value":"EMSMFZ5JS42FEOG6","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_8","alias_value":"EMSMFZ5J","created_at":"2026-06-12T01:10:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EMSMFZ5JS42FEOG622DKNA5WAY","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T17:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"cc570e2c49ca4088b1830bfa3718671cbb808225f3646861852dc49b97e57d6c","abstract_canon_sha256":"444fc559a6798426e66d603b2cf72fe4e200a77aec9798ff8b3b8a3ef09458e8"},"schema_version":"1.0"},"canonical_sha256":"2324c2e7a997345238ded686a683b60606cf9ffa5f25640c1a312aecb1cdc30f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:11.518804Z","signature_b64":"TB2cHX0xOxi5PjQit/ds6oJJp0NwoevcsRS4zonUa65ypCNrj4v4dmjbUcr3BmRdSsYkkBl20Eg0DFE+aHoeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2324c2e7a997345238ded686a683b60606cf9ffa5f25640c1a312aecb1cdc30f","last_reissued_at":"2026-06-12T01:10:11.517978Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:11.517978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13583","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-06-12T01:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYR3+BgggjPUWom1YI2jazMbMKOJffNPqUVxRdeGFenQKcd/v5YGKheh4n2N86FAFnlr2h9TCns3FFGL60leBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:59:51.905660Z"},"content_sha256":"ab13078134a670051d166d4a319fbd474bcabaf57e9b1150329f5facd3cd1bc1","schema_version":"1.0","event_id":"sha256:ab13078134a670051d166d4a319fbd474bcabaf57e9b1150329f5facd3cd1bc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EMSMFZ5JS42FEOG622DKNA5WAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Bipartiteness in Logarithmic Rounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ronitt Rubinfeld, Yumou Fei","submitted_at":"2026-06-11T17:07:00Z","abstract_excerpt":"The seminal work of Goldreich and Ron (\\textit{Combinatorica, 1999}) showed that bipartiteness of bounded-degree graphs can be tested using $O(\\sqrt{n\\log n})$ random walks of length $O(\\log^{6} n)$. In this work, we improve their result by showing that $O(\\sqrt{n})$ random walks of length $O(\\log n)$ suffice. As a corollary, we obtain an $O(\\log n)$-pass, $O(\\sqrt{n}\\log n)$-space streaming algorithm for testing bipartiteness, whose pass complexity is optimal in light of a recent lower bound of Fei, Minzer, and Wang (\\textit{arXiv, 2026}).\n  Our proof takes a different approach from that of G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13583","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/2606.13583/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-06-12T01:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zO92I5UJ7e8eyteW5j/N+JWuf/kCwd3e19zwgqb/stqy6t6NeXwmGmrFkAeNIzmmveRLZc1AB84PDLI54tXPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:59:51.906044Z"},"content_sha256":"3965d57a0aa588a4a07f1894cb4256f67003bbb7e5dd30f4bc16c733c1f05411","schema_version":"1.0","event_id":"sha256:3965d57a0aa588a4a07f1894cb4256f67003bbb7e5dd30f4bc16c733c1f05411"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMSMFZ5JS42FEOG622DKNA5WAY/bundle.json","state_url":"https://pith.science/pith/EMSMFZ5JS42FEOG622DKNA5WAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMSMFZ5JS42FEOG622DKNA5WAY/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-06-30T15:59:51Z","links":{"resolver":"https://pith.science/pith/EMSMFZ5JS42FEOG622DKNA5WAY","bundle":"https://pith.science/pith/EMSMFZ5JS42FEOG622DKNA5WAY/bundle.json","state":"https://pith.science/pith/EMSMFZ5JS42FEOG622DKNA5WAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMSMFZ5JS42FEOG622DKNA5WAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EMSMFZ5JS42FEOG622DKNA5WAY","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":"444fc559a6798426e66d603b2cf72fe4e200a77aec9798ff8b3b8a3ef09458e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T17:07:00Z","title_canon_sha256":"cc570e2c49ca4088b1830bfa3718671cbb808225f3646861852dc49b97e57d6c"},"schema_version":"1.0","source":{"id":"2606.13583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13583","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13583v1","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13583","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"EMSMFZ5JS42F","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_16","alias_value":"EMSMFZ5JS42FEOG6","created_at":"2026-06-12T01:10:11Z"},{"alias_kind":"pith_short_8","alias_value":"EMSMFZ5J","created_at":"2026-06-12T01:10:11Z"}],"graph_snapshots":[{"event_id":"sha256:3965d57a0aa588a4a07f1894cb4256f67003bbb7e5dd30f4bc16c733c1f05411","target":"graph","created_at":"2026-06-12T01:10:11Z","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/2606.13583/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The seminal work of Goldreich and Ron (\\textit{Combinatorica, 1999}) showed that bipartiteness of bounded-degree graphs can be tested using $O(\\sqrt{n\\log n})$ random walks of length $O(\\log^{6} n)$. In this work, we improve their result by showing that $O(\\sqrt{n})$ random walks of length $O(\\log n)$ suffice. As a corollary, we obtain an $O(\\log n)$-pass, $O(\\sqrt{n}\\log n)$-space streaming algorithm for testing bipartiteness, whose pass complexity is optimal in light of a recent lower bound of Fei, Minzer, and Wang (\\textit{arXiv, 2026}).\n  Our proof takes a different approach from that of G","authors_text":"Ronitt Rubinfeld, Yumou Fei","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13583","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:ab13078134a670051d166d4a319fbd474bcabaf57e9b1150329f5facd3cd1bc1","target":"record","created_at":"2026-06-12T01:10:11Z","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":"444fc559a6798426e66d603b2cf72fe4e200a77aec9798ff8b3b8a3ef09458e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T17:07:00Z","title_canon_sha256":"cc570e2c49ca4088b1830bfa3718671cbb808225f3646861852dc49b97e57d6c"},"schema_version":"1.0","source":{"id":"2606.13583","kind":"arxiv","version":1}},"canonical_sha256":"2324c2e7a997345238ded686a683b60606cf9ffa5f25640c1a312aecb1cdc30f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2324c2e7a997345238ded686a683b60606cf9ffa5f25640c1a312aecb1cdc30f","first_computed_at":"2026-06-12T01:10:11.517978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:10:11.517978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TB2cHX0xOxi5PjQit/ds6oJJp0NwoevcsRS4zonUa65ypCNrj4v4dmjbUcr3BmRdSsYkkBl20Eg0DFE+aHoeDQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:10:11.518804Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab13078134a670051d166d4a319fbd474bcabaf57e9b1150329f5facd3cd1bc1","sha256:3965d57a0aa588a4a07f1894cb4256f67003bbb7e5dd30f4bc16c733c1f05411"],"state_sha256":"942f82daff9e4870f57e0f3424adc64997ece8237e9919378a384e49396d41b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jj+mHjKN4yGCZe03riMOExwBa+QGnEVMEsY9ZjIHqAGvwNsPxpmJHVnlBqJxjwEIXruXAfiIQ/O6XSyMPzFEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:59:51.907924Z","bundle_sha256":"9979ff00d5a991a81943759ee0f9b55754f6e9c1e4c6d8f77ab0ec3d7ecc9a6d"}}