{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4O66NNMIC3LO6PSO3YVMFAF4EG","short_pith_number":"pith:4O66NNMI","canonical_record":{"source":{"id":"1907.04381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T19:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"627f987037ca67d38be56774e6c3ae6fe4cd6f55f62690b07fbe5327d9587d22","abstract_canon_sha256":"c4b9eadfa6aa70dd4b3e5e6483aad7ab46d85bf1d56dc4967c9bbd802c5e03ae"},"schema_version":"1.0"},"canonical_sha256":"e3bde6b58816d6ef3e4ede2ac280bc21ae5a8a21b072f6fe0cc8dae68a952173","source":{"kind":"arxiv","id":"1907.04381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04381","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04381v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04381","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"4O66NNMIC3LO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4O66NNMIC3LO6PSO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4O66NNMI","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4O66NNMIC3LO6PSO3YVMFAF4EG","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T19:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"627f987037ca67d38be56774e6c3ae6fe4cd6f55f62690b07fbe5327d9587d22","abstract_canon_sha256":"c4b9eadfa6aa70dd4b3e5e6483aad7ab46d85bf1d56dc4967c9bbd802c5e03ae"},"schema_version":"1.0"},"canonical_sha256":"e3bde6b58816d6ef3e4ede2ac280bc21ae5a8a21b072f6fe0cc8dae68a952173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.923279Z","signature_b64":"XaIxk9LT8kHmjjH70/X4PuEPTyXAaV2Cd92LvTr3LHWcJ8H0iM2yw4CSpvow8Rpa8UZA6zFw2Yf5+f3wTzkgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3bde6b58816d6ef3e4ede2ac280bc21ae5a8a21b072f6fe0cc8dae68a952173","last_reissued_at":"2026-05-17T23:41:01.922451Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.922451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04381","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-17T23:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLOhicmlg9Cb7N+/MFeMHDXLvqc4vl6phl8riqSjjw9zLKNC4R4YRSLCZX8eik39rGz+ZIAMM5JN0j1PjupZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:11:37.919243Z"},"content_sha256":"76709e6fbfe9c2e2cbe81bf711eeba9153bc39053081a84fda545177b8cf2305","schema_version":"1.0","event_id":"sha256:76709e6fbfe9c2e2cbe81bf711eeba9153bc39053081a84fda545177b8cf2305"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4O66NNMIC3LO6PSO3YVMFAF4EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly optimal edge estimation with independent set queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Levi, Erik Waingarten, Xi Chen","submitted_at":"2019-07-09T19:48:24Z","abstract_excerpt":"We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an independent set in $G$ or not. Our first main result is an algorithm that computes a $(1+\\epsilon)$-approximation of the number of edges $m$ of the graph using $\\min(\\sqrt{m},n / \\sqrt{m})\\cdot\\textrm{poly}(\\log n,1/\\epsilon)$ independent set queries. This improves the upper bound of $\\min(\\sqrt{m},n^2/m)\\cdot\\textrm{poly}(\\log n,1/\\epsilon)$ by B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04381","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-17T23:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4IwISWC+IqP+VGfWn9CYfBoW4PzO+DOKB/OIuE+mGa6an3y9UFGzg5YlxKv2vtqQ41e2s26VIOMexNhGo6tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:11:37.919987Z"},"content_sha256":"c630ffdfed0a751d995a9e8a870c39c3ff9362dbc9baed1f0a52f8dfa35a3e92","schema_version":"1.0","event_id":"sha256:c630ffdfed0a751d995a9e8a870c39c3ff9362dbc9baed1f0a52f8dfa35a3e92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4O66NNMIC3LO6PSO3YVMFAF4EG/bundle.json","state_url":"https://pith.science/pith/4O66NNMIC3LO6PSO3YVMFAF4EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4O66NNMIC3LO6PSO3YVMFAF4EG/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-05-25T11:11:37Z","links":{"resolver":"https://pith.science/pith/4O66NNMIC3LO6PSO3YVMFAF4EG","bundle":"https://pith.science/pith/4O66NNMIC3LO6PSO3YVMFAF4EG/bundle.json","state":"https://pith.science/pith/4O66NNMIC3LO6PSO3YVMFAF4EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4O66NNMIC3LO6PSO3YVMFAF4EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4O66NNMIC3LO6PSO3YVMFAF4EG","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":"c4b9eadfa6aa70dd4b3e5e6483aad7ab46d85bf1d56dc4967c9bbd802c5e03ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T19:48:24Z","title_canon_sha256":"627f987037ca67d38be56774e6c3ae6fe4cd6f55f62690b07fbe5327d9587d22"},"schema_version":"1.0","source":{"id":"1907.04381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04381","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04381v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04381","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"4O66NNMIC3LO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4O66NNMIC3LO6PSO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4O66NNMI","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c630ffdfed0a751d995a9e8a870c39c3ff9362dbc9baed1f0a52f8dfa35a3e92","target":"graph","created_at":"2026-05-17T23:41:01Z","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 study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an independent set in $G$ or not. Our first main result is an algorithm that computes a $(1+\\epsilon)$-approximation of the number of edges $m$ of the graph using $\\min(\\sqrt{m},n / \\sqrt{m})\\cdot\\textrm{poly}(\\log n,1/\\epsilon)$ independent set queries. This improves the upper bound of $\\min(\\sqrt{m},n^2/m)\\cdot\\textrm{poly}(\\log n,1/\\epsilon)$ by B","authors_text":"Amit Levi, Erik Waingarten, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T19:48:24Z","title":"Nearly optimal edge estimation with independent set queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04381","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:76709e6fbfe9c2e2cbe81bf711eeba9153bc39053081a84fda545177b8cf2305","target":"record","created_at":"2026-05-17T23:41:01Z","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":"c4b9eadfa6aa70dd4b3e5e6483aad7ab46d85bf1d56dc4967c9bbd802c5e03ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T19:48:24Z","title_canon_sha256":"627f987037ca67d38be56774e6c3ae6fe4cd6f55f62690b07fbe5327d9587d22"},"schema_version":"1.0","source":{"id":"1907.04381","kind":"arxiv","version":1}},"canonical_sha256":"e3bde6b58816d6ef3e4ede2ac280bc21ae5a8a21b072f6fe0cc8dae68a952173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3bde6b58816d6ef3e4ede2ac280bc21ae5a8a21b072f6fe0cc8dae68a952173","first_computed_at":"2026-05-17T23:41:01.922451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:01.922451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XaIxk9LT8kHmjjH70/X4PuEPTyXAaV2Cd92LvTr3LHWcJ8H0iM2yw4CSpvow8Rpa8UZA6zFw2Yf5+f3wTzkgCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:01.923279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76709e6fbfe9c2e2cbe81bf711eeba9153bc39053081a84fda545177b8cf2305","sha256:c630ffdfed0a751d995a9e8a870c39c3ff9362dbc9baed1f0a52f8dfa35a3e92"],"state_sha256":"c6d0f723b90655ecfa931ae8cc10639c8898fcbcec6af23fd78d9d1c4470a87e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+towOsXe8aK7q434N1XCxEDj7aDLxbW+S0pO2aQBf+Fcol9opP6R5n2YuPxz0m66Bd4EkmCfR/CHtWdfFbWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:11:37.923713Z","bundle_sha256":"8429f9178a5b398b07da25dd3eca84db7573c9c658b86e515fc8cf3d59420726"}}