{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KEQLUVBQCP7CWPDAHVBWEELWU6","short_pith_number":"pith:KEQLUVBQ","schema_version":"1.0","canonical_sha256":"5120ba543013fe2b3c603d43621176a7a12e5dfcb5937062ac2281f27f61e78e","source":{"kind":"arxiv","id":"1905.03070","version":2},"attestation_state":"computed","paper":{"title":"Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oded Goldreich","submitted_at":"2019-05-08T13:48:13Z","abstract_excerpt":"In a recent work (ECCC, TR18-171, 2018), we introduced models of testing graph properties in which, in addition to answers to the usual graph-queries, the tester obtains {\\em random vertices drawn according to an arbitrary distribution $D$}. Such a tester is required to distinguish between graphs that have the property and graphs that are far from having the property, {\\em where the distance between graphs is defined based on the unknown vertex distribution $D$}. These (\"vertex-distribution free\" (VDF)) models generalize the standard models in which $D$ is postulated to be uniform on the verte"},"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":"1905.03070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T13:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c2a463ede279cfa68c2a10f473f7e4840ca521e6542f6e6c40e8e5b27869a6c","abstract_canon_sha256":"f41281351869d244ac49c86af0070591aa907efd1f729691d59e7dece401243a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.871618Z","signature_b64":"eheAFs8AoKi9ieVgMRhAvIJ7oUKh3BvliDGRpNlU2yGwRZUMT9gNtjdZlHjideM/VKUWiGc2u8jK7zE1Vyw1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5120ba543013fe2b3c603d43621176a7a12e5dfcb5937062ac2281f27f61e78e","last_reissued_at":"2026-05-17T23:44:06.870974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.870974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oded Goldreich","submitted_at":"2019-05-08T13:48:13Z","abstract_excerpt":"In a recent work (ECCC, TR18-171, 2018), we introduced models of testing graph properties in which, in addition to answers to the usual graph-queries, the tester obtains {\\em random vertices drawn according to an arbitrary distribution $D$}. Such a tester is required to distinguish between graphs that have the property and graphs that are far from having the property, {\\em where the distance between graphs is defined based on the unknown vertex distribution $D$}. These (\"vertex-distribution free\" (VDF)) models generalize the standard models in which $D$ is postulated to be uniform on the verte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03070","kind":"arxiv","version":2},"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":"1905.03070","created_at":"2026-05-17T23:44:06.871139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03070v2","created_at":"2026-05-17T23:44:06.871139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03070","created_at":"2026-05-17T23:44:06.871139+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEQLUVBQCP7C","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEQLUVBQCP7CWPDA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEQLUVBQ","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2410.18915","citing_title":"Testing Support Size More Efficiently Than Learning Histograms","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6","json":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6.json","graph_json":"https://pith.science/api/pith-number/KEQLUVBQCP7CWPDAHVBWEELWU6/graph.json","events_json":"https://pith.science/api/pith-number/KEQLUVBQCP7CWPDAHVBWEELWU6/events.json","paper":"https://pith.science/paper/KEQLUVBQ"},"agent_actions":{"view_html":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6","download_json":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6.json","view_paper":"https://pith.science/paper/KEQLUVBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03070&json=true","fetch_graph":"https://pith.science/api/pith-number/KEQLUVBQCP7CWPDAHVBWEELWU6/graph.json","fetch_events":"https://pith.science/api/pith-number/KEQLUVBQCP7CWPDAHVBWEELWU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6/action/storage_attestation","attest_author":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6/action/author_attestation","sign_citation":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6/action/citation_signature","submit_replication":"https://pith.science/pith/KEQLUVBQCP7CWPDAHVBWEELWU6/action/replication_record"}},"created_at":"2026-05-17T23:44:06.871139+00:00","updated_at":"2026-05-17T23:44:06.871139+00:00"}