{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:G53JAE5IJ2AI7RKOPEUXQPXZLM","short_pith_number":"pith:G53JAE5I","schema_version":"1.0","canonical_sha256":"37769013a84e808fc54e7929783ef95b019cf7f3b2e8b4be8fd73764f44d732c","source":{"kind":"arxiv","id":"1011.0531","version":1},"attestation_state":"computed","paper":{"title":"A better tester for bipartiteness?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Bogdanov, Fan Li","submitted_at":"2010-11-02T07:48:15Z","abstract_excerpt":"Alon and Krivelevich (SIAM J. Discrete Math. 15(2): 211-227 (2002)) show that if a graph is {\\epsilon}-far from bipartite, then the subgraph induced by a random subset of O(1/{\\epsilon}) vertices is bipartite with high probability. We conjecture that the induced subgraph is {\\Omega}~({\\epsilon})-far from bipartite with high probability. Gonen and Ron (RANDOM 2007) proved this conjecture in the case when the degrees of all vertices are at most O({\\epsilon}n). We give a more general proof that works for any d-regular (or almost d-regular) graph for arbitrary degree d. Assuming this conjecture, w"},"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":"1011.0531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-02T07:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"e27c988cee322f8b322157378878b977335095613caa9df904f86ca7b6fa538c","abstract_canon_sha256":"998665a51f618aed1f6cfa47c376907623eb25c92b391686cab093c513d58df8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:21.398294Z","signature_b64":"3IZqRFyJ2nFGMiWFPyMSQ6ARFwVE+Nym25+nbDEvponuVi2DU6hvRT5HftEWH1dPSrr1ygQ5aLm7qi9IiYlABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37769013a84e808fc54e7929783ef95b019cf7f3b2e8b4be8fd73764f44d732c","last_reissued_at":"2026-05-18T04:37:21.397626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:21.397626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A better tester for bipartiteness?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Bogdanov, Fan Li","submitted_at":"2010-11-02T07:48:15Z","abstract_excerpt":"Alon and Krivelevich (SIAM J. Discrete Math. 15(2): 211-227 (2002)) show that if a graph is {\\epsilon}-far from bipartite, then the subgraph induced by a random subset of O(1/{\\epsilon}) vertices is bipartite with high probability. We conjecture that the induced subgraph is {\\Omega}~({\\epsilon})-far from bipartite with high probability. Gonen and Ron (RANDOM 2007) proved this conjecture in the case when the degrees of all vertices are at most O({\\epsilon}n). We give a more general proof that works for any d-regular (or almost d-regular) graph for arbitrary degree d. Assuming this conjecture, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0531","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":"1011.0531","created_at":"2026-05-18T04:37:21.397733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0531v1","created_at":"2026-05-18T04:37:21.397733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0531","created_at":"2026-05-18T04:37:21.397733+00:00"},{"alias_kind":"pith_short_12","alias_value":"G53JAE5IJ2AI","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"G53JAE5IJ2AI7RKO","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"G53JAE5I","created_at":"2026-05-18T12:26:07.630475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM","json":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM.json","graph_json":"https://pith.science/api/pith-number/G53JAE5IJ2AI7RKOPEUXQPXZLM/graph.json","events_json":"https://pith.science/api/pith-number/G53JAE5IJ2AI7RKOPEUXQPXZLM/events.json","paper":"https://pith.science/paper/G53JAE5I"},"agent_actions":{"view_html":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM","download_json":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM.json","view_paper":"https://pith.science/paper/G53JAE5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0531&json=true","fetch_graph":"https://pith.science/api/pith-number/G53JAE5IJ2AI7RKOPEUXQPXZLM/graph.json","fetch_events":"https://pith.science/api/pith-number/G53JAE5IJ2AI7RKOPEUXQPXZLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM/action/storage_attestation","attest_author":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM/action/author_attestation","sign_citation":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM/action/citation_signature","submit_replication":"https://pith.science/pith/G53JAE5IJ2AI7RKOPEUXQPXZLM/action/replication_record"}},"created_at":"2026-05-18T04:37:21.397733+00:00","updated_at":"2026-05-18T04:37:21.397733+00:00"}