{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EJVPDZMBR5HVD3AWYTU3KJWYAO","short_pith_number":"pith:EJVPDZMB","schema_version":"1.0","canonical_sha256":"226af1e5818f4f51ec16c4e9b526d803907e9231a1a6a3eb9acbd66e238e2177","source":{"kind":"arxiv","id":"1902.08086","version":1},"attestation_state":"computed","paper":{"title":"The Arboricity Captures the Complexity of Sampling Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dana Ron, Talya Eden, Will Rosenbaum","submitted_at":"2019-02-21T15:03:44Z","abstract_excerpt":"In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$. Given query access to a graph $G$ over $n$ vertices and of average degree $d$ and arboricity at most $\\alpha$, we design an algorithm that performs $O\\!\\left(\\frac{\\alpha}{d} \\cdot \\frac{\\log^3 n}{\\varepsilon}\\right)$ queries in expectation and returns an edge in the graph such that every edge $e \\in E$ is sampled with probability $(1 \\pm \\varepsilon)/m$. T"},"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":"1902.08086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T15:03:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bc742ff776a7744302f5f2ff998af9f94d6879e766ba41f4553b32ac809a1b2b","abstract_canon_sha256":"caf6d44f4f7c005e2662bb647e720ebe9aa2c17a71acb0dd7ca73337260dd973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:02.105712Z","signature_b64":"7u5xmVsTosyphgvRO7sJdOJ6i2k/2uc9PFHGBaKNGDWkZEFVzKC1J3n+tEKrgm9wu1EfjzY9fi88VCFaI0PnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226af1e5818f4f51ec16c4e9b526d803907e9231a1a6a3eb9acbd66e238e2177","last_reissued_at":"2026-05-17T23:53:02.105193Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:02.105193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Arboricity Captures the Complexity of Sampling Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dana Ron, Talya Eden, Will Rosenbaum","submitted_at":"2019-02-21T15:03:44Z","abstract_excerpt":"In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$. Given query access to a graph $G$ over $n$ vertices and of average degree $d$ and arboricity at most $\\alpha$, we design an algorithm that performs $O\\!\\left(\\frac{\\alpha}{d} \\cdot \\frac{\\log^3 n}{\\varepsilon}\\right)$ queries in expectation and returns an edge in the graph such that every edge $e \\in E$ is sampled with probability $(1 \\pm \\varepsilon)/m$. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08086","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":"1902.08086","created_at":"2026-05-17T23:53:02.105274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08086v1","created_at":"2026-05-17T23:53:02.105274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08086","created_at":"2026-05-17T23:53:02.105274+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJVPDZMBR5HV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJVPDZMBR5HVD3AW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJVPDZMB","created_at":"2026-05-18T12:33:15.570797+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/EJVPDZMBR5HVD3AWYTU3KJWYAO","json":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO.json","graph_json":"https://pith.science/api/pith-number/EJVPDZMBR5HVD3AWYTU3KJWYAO/graph.json","events_json":"https://pith.science/api/pith-number/EJVPDZMBR5HVD3AWYTU3KJWYAO/events.json","paper":"https://pith.science/paper/EJVPDZMB"},"agent_actions":{"view_html":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO","download_json":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO.json","view_paper":"https://pith.science/paper/EJVPDZMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08086&json=true","fetch_graph":"https://pith.science/api/pith-number/EJVPDZMBR5HVD3AWYTU3KJWYAO/graph.json","fetch_events":"https://pith.science/api/pith-number/EJVPDZMBR5HVD3AWYTU3KJWYAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO/action/storage_attestation","attest_author":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO/action/author_attestation","sign_citation":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO/action/citation_signature","submit_replication":"https://pith.science/pith/EJVPDZMBR5HVD3AWYTU3KJWYAO/action/replication_record"}},"created_at":"2026-05-17T23:53:02.105274+00:00","updated_at":"2026-05-17T23:53:02.105274+00:00"}