{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4QIJLDQQTCHUCPDQLKTOLIH3ED","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":"e2115cf3a49f607ec2d7dacd8211d433fc998907669a25470af4a8738e39e4b8","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-29T13:31:36Z","title_canon_sha256":"7e53de82871ba7638bdb690147e7899574a7f3316ee418cd6ba5bf0cd0ff39ee"},"schema_version":"1.0","source":{"id":"1706.09748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09748","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09748v1","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09748","created_at":"2026-05-18T00:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"4QIJLDQQTCHU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QIJLDQQTCHUCPDQ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QIJLDQQ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:2dc24f3283c3e51c96f4d7a1d3929ed0c3f6d50731dc16602d2b3398ab757bc9","target":"graph","created_at":"2026-05-18T00:41:14Z","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":"We consider the problem of sampling an edge almost uniformly from an unknown graph, $G = (V, E)$. Access to the graph is provided via queries of the following types: (1) uniform vertex queries, (2) degree queries, and (3) neighbor queries. We describe an algorithm that returns a random edge $e \\in E$ using $\\tilde{O}(n / \\sqrt{\\varepsilon m})$ queries in expectation, where $n = |V|$ is the number of vertices, and $m = |E|$ is the number of edges, such that each edge $e$ is sampled with probability $(1 \\pm \\varepsilon)/m$. We prove that our algorithm is optimal in the sense that any algorithm t","authors_text":"Talya Eden, Will Rosenbaum","cross_cats":["cs.DM","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-29T13:31:36Z","title":"On Sampling Edges Almost Uniformly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09748","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:fe75f4a1b6b0cebfb5c3152716bfe09c5da77b429a15d782eec5fbfd0678929a","target":"record","created_at":"2026-05-18T00:41:14Z","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":"e2115cf3a49f607ec2d7dacd8211d433fc998907669a25470af4a8738e39e4b8","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-29T13:31:36Z","title_canon_sha256":"7e53de82871ba7638bdb690147e7899574a7f3316ee418cd6ba5bf0cd0ff39ee"},"schema_version":"1.0","source":{"id":"1706.09748","kind":"arxiv","version":1}},"canonical_sha256":"e410958e10988f413c705aa6e5a0fb20d89a861b3bfbe1019f8d3e7fc7d04f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e410958e10988f413c705aa6e5a0fb20d89a861b3bfbe1019f8d3e7fc7d04f6e","first_computed_at":"2026-05-18T00:41:14.000769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:14.000769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0vI1yFmhrK2uZCV2l4BQC8B2QIH5p/MztzEUkluf29/jHOZaeewANz8JVeiBe0uAkScB01Kuk5qrQbihTeFDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:14.001398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe75f4a1b6b0cebfb5c3152716bfe09c5da77b429a15d782eec5fbfd0678929a","sha256:2dc24f3283c3e51c96f4d7a1d3929ed0c3f6d50731dc16602d2b3398ab757bc9"],"state_sha256":"2c6e5d9f39fa5e78c54a560ca4702a41f35192561bb82c4282a074524094ebd7"}