{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EJVPDZMBR5HVD3AWYTU3KJWYAO","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":"caf6d44f4f7c005e2662bb647e720ebe9aa2c17a71acb0dd7ca73337260dd973","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T15:03:44Z","title_canon_sha256":"bc742ff776a7744302f5f2ff998af9f94d6879e766ba41f4553b32ac809a1b2b"},"schema_version":"1.0","source":{"id":"1902.08086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08086","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08086v1","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08086","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"EJVPDZMBR5HV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EJVPDZMBR5HVD3AW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EJVPDZMB","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ac44c57583b19961fb59c2d6e227f1c28d6867893d6eb813701875c8131003eb","target":"graph","created_at":"2026-05-17T23:53:02Z","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"},"paper":{"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","authors_text":"Dana Ron, Talya Eden, Will Rosenbaum","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T15:03:44Z","title":"The Arboricity Captures the Complexity of Sampling Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08086","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:80893f38b2877400c88813efca3d6c26e5f5e0b0b71efd499bf34b708040a6de","target":"record","created_at":"2026-05-17T23:53:02Z","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":"caf6d44f4f7c005e2662bb647e720ebe9aa2c17a71acb0dd7ca73337260dd973","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T15:03:44Z","title_canon_sha256":"bc742ff776a7744302f5f2ff998af9f94d6879e766ba41f4553b32ac809a1b2b"},"schema_version":"1.0","source":{"id":"1902.08086","kind":"arxiv","version":1}},"canonical_sha256":"226af1e5818f4f51ec16c4e9b526d803907e9231a1a6a3eb9acbd66e238e2177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"226af1e5818f4f51ec16c4e9b526d803907e9231a1a6a3eb9acbd66e238e2177","first_computed_at":"2026-05-17T23:53:02.105193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:02.105193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7u5xmVsTosyphgvRO7sJdOJ6i2k/2uc9PFHGBaKNGDWkZEFVzKC1J3n+tEKrgm9wu1EfjzY9fi88VCFaI0PnDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:02.105712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80893f38b2877400c88813efca3d6c26e5f5e0b0b71efd499bf34b708040a6de","sha256:ac44c57583b19961fb59c2d6e227f1c28d6867893d6eb813701875c8131003eb"],"state_sha256":"d31c29ad11d3b67732431663f45886e739ef44bb1af8d02709b3fe78b857fbef"}