{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OUUPG3DPAAK6LXG65Y56V43QKN","short_pith_number":"pith:OUUPG3DP","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"},"canonical_sha256":"7528f36c6f0015e5dcdeee3beaf37053703191b27aafaa3c9fd4b141f414b2d3","source":{"kind":"arxiv","id":"1702.08299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08299","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08299v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08299","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"OUUPG3DPAAK6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUUPG3DPAAK6LXG6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUUPG3DP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OUUPG3DPAAK6LXG65Y56V43QKN","target":"record","payload":{"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"},"canonical_sha256":"7528f36c6f0015e5dcdeee3beaf37053703191b27aafaa3c9fd4b141f414b2d3","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"},"source_kind":"arxiv","source_id":"1702.08299","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:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZDzc9Mp4N93Ehla9pzZrmiikM249DeMGbPeHRmB0EbLUKq7Ef/xiIvfjmIX7D/7w8ZiXjxac7qMGrYFmFDXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:31.585055Z"},"content_sha256":"66470cabc3037853561d50cb8cf0f58490fe175d36d10da4c3b88a520a42fe5e","schema_version":"1.0","event_id":"sha256:66470cabc3037853561d50cb8cf0f58490fe175d36d10da4c3b88a520a42fe5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OUUPG3DPAAK6LXG65Y56V43QKN","target":"graph","payload":{"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"},"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:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkNAlYgBFkKOXakkj5mDMRQwZvYvH3+Q0vPAfgf8Z7SjSh3aQ7yYjhgayauN2eZ9zSECd+PqDVTg8bets8b0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:31.585711Z"},"content_sha256":"2af4e786a100d8ee1fcc615bdff4eccd48a16fd9abf8826513f45291250f283e","schema_version":"1.0","event_id":"sha256:2af4e786a100d8ee1fcc615bdff4eccd48a16fd9abf8826513f45291250f283e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/bundle.json","state_url":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUUPG3DPAAK6LXG65Y56V43QKN/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-27T16:10:31Z","links":{"resolver":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN","bundle":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/bundle.json","state":"https://pith.science/pith/OUUPG3DPAAK6LXG65Y56V43QKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUUPG3DPAAK6LXG65Y56V43QKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OUUPG3DPAAK6LXG65Y56V43QKN","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":"ff14cdd86a7af50a284124cc51bbbfa5f474086e6ca03409954f45bbc3882ff9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T14:25:36Z","title_canon_sha256":"00657b206137312a757d160dfa030d731bdaf9a64f74e04ab195b3761e648117"},"schema_version":"1.0","source":{"id":"1702.08299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08299","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08299v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08299","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"OUUPG3DPAAK6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUUPG3DPAAK6LXG6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUUPG3DP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:2af4e786a100d8ee1fcc615bdff4eccd48a16fd9abf8826513f45291250f283e","target":"graph","created_at":"2026-05-18T00:49:55Z","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 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","authors_text":"Christian Konrad, Graham Cormode, Jacques Dark","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T14:25:36Z","title":"Independent Set Size Approximation in Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08299","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:66470cabc3037853561d50cb8cf0f58490fe175d36d10da4c3b88a520a42fe5e","target":"record","created_at":"2026-05-18T00:49:55Z","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":"ff14cdd86a7af50a284124cc51bbbfa5f474086e6ca03409954f45bbc3882ff9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T14:25:36Z","title_canon_sha256":"00657b206137312a757d160dfa030d731bdaf9a64f74e04ab195b3761e648117"},"schema_version":"1.0","source":{"id":"1702.08299","kind":"arxiv","version":1}},"canonical_sha256":"7528f36c6f0015e5dcdeee3beaf37053703191b27aafaa3c9fd4b141f414b2d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7528f36c6f0015e5dcdeee3beaf37053703191b27aafaa3c9fd4b141f414b2d3","first_computed_at":"2026-05-18T00:49:55.298687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:55.298687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMJxRoEZIuGKghkjIbT3gyfHIZa/XNGa1JFA5ASbZzfyJ+H+W6VCYTREX0t317rscbbTC+bXxqusKztOa8wuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:55.299380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66470cabc3037853561d50cb8cf0f58490fe175d36d10da4c3b88a520a42fe5e","sha256:2af4e786a100d8ee1fcc615bdff4eccd48a16fd9abf8826513f45291250f283e"],"state_sha256":"65cd8ee4419082486b200e2b24c14fa7b5f5cd4e723abc309109c17f011a2265"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9ura2BFkdj44mbSANyoIISQIjZLCPyes4XN8GwGI+0IkH94HRJguUiXFKC3P3i4zBZtWtw5WUP6CuASdduCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:10:31.588817Z","bundle_sha256":"8fda5b38847bdb03e5b5160beca29109769e9941d6ff8c1362284156ee6abbcd"}}