{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OUUPG3DPAAK6LXG65Y56V43QKN","short_pith_number":"pith:OUUPG3DP","schema_version":"1.0","canonical_sha256":"7528f36c6f0015e5dcdeee3beaf37053703191b27aafaa3c9fd4b141f414b2d3","source":{"kind":"arxiv","id":"1702.08299","version":1},"attestation_state":"computed","paper":{"title":"Independent Set Size Approximation in Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Graham Cormode, Jacques Dark","submitted_at":"2017-02-27T14:25:36Z","abstract_excerpt":"We study the problem of estimating the size of independent sets in a graph $G$ defined by a stream of edges. Our approach relies on the Caro-Wei bound, which expresses the desired quantity in terms of a sum over nodes of the reciprocal of their degrees, denoted by $\\beta(G)$. Our results show that $\\beta(G)$ can be approximated accurately, based on a provided lower bound on $\\beta$. Stronger results are possible when the edges are promised to arrive grouped by an incident node. In this setting, we obtain a value that is at most a logarithmic factor below the true value of $\\beta$ and no more 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":"1702.08299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T14:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"00657b206137312a757d160dfa030d731bdaf9a64f74e04ab195b3761e648117","abstract_canon_sha256":"ff14cdd86a7af50a284124cc51bbbfa5f474086e6ca03409954f45bbc3882ff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:55.299380Z","signature_b64":"tMJxRoEZIuGKghkjIbT3gyfHIZa/XNGa1JFA5ASbZzfyJ+H+W6VCYTREX0t317rscbbTC+bXxqusKztOa8wuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7528f36c6f0015e5dcdeee3beaf37053703191b27aafaa3c9fd4b141f414b2d3","last_reissued_at":"2026-05-18T00:49:55.298687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:55.298687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent Set Size Approximation in Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Graham Cormode, Jacques Dark","submitted_at":"2017-02-27T14:25:36Z","abstract_excerpt":"We study the problem of estimating the size of independent sets in a graph $G$ defined by a stream of edges. Our approach relies on the Caro-Wei bound, which expresses the desired quantity in terms of a sum over nodes of the reciprocal of their degrees, denoted by $\\beta(G)$. Our results show that $\\beta(G)$ can be approximated accurately, based on a provided lower bound on $\\beta$. Stronger results are possible when the edges are promised to arrive grouped by an incident node. In this setting, we obtain a value that is at most a logarithmic factor below the true value of $\\beta$ and no more t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08299","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":"1702.08299","created_at":"2026-05-18T00:49:55.298795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08299v1","created_at":"2026-05-18T00:49:55.298795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08299","created_at":"2026-05-18T00:49:55.298795+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUUPG3DPAAK6","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUUPG3DPAAK6LXG6","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUUPG3DP","created_at":"2026-05-18T12:31:34.259226+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/OUUPG3DPAAK6LXG65Y56V43QKN","json":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN.json","graph_json":"https://pith.science/api/pith-number/OUUPG3DPAAK6LXG65Y56V43QKN/graph.json","events_json":"https://pith.science/api/pith-number/OUUPG3DPAAK6LXG65Y56V43QKN/events.json","paper":"https://pith.science/paper/OUUPG3DP"},"agent_actions":{"view_html":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN","download_json":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN.json","view_paper":"https://pith.science/paper/OUUPG3DP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08299&json=true","fetch_graph":"https://pith.science/api/pith-number/OUUPG3DPAAK6LXG65Y56V43QKN/graph.json","fetch_events":"https://pith.science/api/pith-number/OUUPG3DPAAK6LXG65Y56V43QKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/action/storage_attestation","attest_author":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/action/author_attestation","sign_citation":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/action/citation_signature","submit_replication":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/action/replication_record"}},"created_at":"2026-05-18T00:49:55.298795+00:00","updated_at":"2026-05-18T00:49:55.298795+00:00"}