{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4QIJLDQQTCHUCPDQLKTOLIH3ED","short_pith_number":"pith:4QIJLDQQ","canonical_record":{"source":{"id":"1706.09748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-29T13:31:36Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"7e53de82871ba7638bdb690147e7899574a7f3316ee418cd6ba5bf0cd0ff39ee","abstract_canon_sha256":"e2115cf3a49f607ec2d7dacd8211d433fc998907669a25470af4a8738e39e4b8"},"schema_version":"1.0"},"canonical_sha256":"e410958e10988f413c705aa6e5a0fb20d89a861b3bfbe1019f8d3e7fc7d04f6e","source":{"kind":"arxiv","id":"1706.09748","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4QIJLDQQTCHUCPDQLKTOLIH3ED","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-29T13:31:36Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"7e53de82871ba7638bdb690147e7899574a7f3316ee418cd6ba5bf0cd0ff39ee","abstract_canon_sha256":"e2115cf3a49f607ec2d7dacd8211d433fc998907669a25470af4a8738e39e4b8"},"schema_version":"1.0"},"canonical_sha256":"e410958e10988f413c705aa6e5a0fb20d89a861b3bfbe1019f8d3e7fc7d04f6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:14.001398Z","signature_b64":"0vI1yFmhrK2uZCV2l4BQC8B2QIH5p/MztzEUkluf29/jHOZaeewANz8JVeiBe0uAkScB01Kuk5qrQbihTeFDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e410958e10988f413c705aa6e5a0fb20d89a861b3bfbe1019f8d3e7fc7d04f6e","last_reissued_at":"2026-05-18T00:41:14.000769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:14.000769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09748","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7sySjtQ13tRaQUvo7T7aZnIqmjCgdRq0bmbdngxq2/Fw+Sw2YZJX+JXPD9OhPuvEPqPJFJuItSlrRIAcHBxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:23:13.421166Z"},"content_sha256":"fe75f4a1b6b0cebfb5c3152716bfe09c5da77b429a15d782eec5fbfd0678929a","schema_version":"1.0","event_id":"sha256:fe75f4a1b6b0cebfb5c3152716bfe09c5da77b429a15d782eec5fbfd0678929a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4QIJLDQQTCHUCPDQLKTOLIH3ED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Sampling Edges Almost Uniformly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Talya Eden, Will Rosenbaum","submitted_at":"2017-06-29T13:31:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09748","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnXHkSSoGWUE27y4eTymEUJyoBaw3nvPg4nNg4KFvbLGy/Wr+jlJ6faelT06JkJ72Cg1We1SwS9ZnAIvszaMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:23:13.421930Z"},"content_sha256":"2dc24f3283c3e51c96f4d7a1d3929ed0c3f6d50731dc16602d2b3398ab757bc9","schema_version":"1.0","event_id":"sha256:2dc24f3283c3e51c96f4d7a1d3929ed0c3f6d50731dc16602d2b3398ab757bc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED/bundle.json","state_url":"https://pith.science/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T02:23:13Z","links":{"resolver":"https://pith.science/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED","bundle":"https://pith.science/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED/bundle.json","state":"https://pith.science/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QIJLDQQTCHUCPDQLKTOLIH3ED/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/4011e/d4pZBSUM58vUn06aa4gD3aPcmuaQnsuZHyENUTck64g/8NO46mpOXE5dFmwzIbBaBFUrD1Owhu+iCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:23:13.425990Z","bundle_sha256":"c993ebed41f72feaec7790e94bfae13cf196e074e6d170e273090449e5c149a5"}}