{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M5GWS347NVGNKHXTHKH5P2E5WB","short_pith_number":"pith:M5GWS347","schema_version":"1.0","canonical_sha256":"674d696f9f6d4cd51ef33a8fd7e89db05ab5232bdd8ee0e2e1e106a1ce8801d0","source":{"kind":"arxiv","id":"1405.0093","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Streaming Algorithms for Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Graham Cormode, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Rajesh Chitnis","submitted_at":"2014-05-01T04:40:11Z","abstract_excerpt":"As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams.\n  In this paper, we introduce a new approach to handling graph streams, by instead seeking solutions for the parameterized versions of these problems where we are given a parameter $k$ and the objective is to decide whether there is a solution bounded by $k$. By combin"},"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":"1405.0093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T04:40:11Z","cross_cats_sorted":[],"title_canon_sha256":"54058955e891b20068f87ed50b14b464331738c63d41d00e3271300a63767532","abstract_canon_sha256":"da34bcf186fe6eff42b4aabf04c2ec95a2322a92ada51e851ea50a78319d896f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:39.029140Z","signature_b64":"1ieT5pHlEOK3hbyEdJzPn6reE+/QX45SjI0Z2tkrDzfriXNJNNCwEneIDSdO7RrN9fHDjjF58+E1lOTG/nzWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"674d696f9f6d4cd51ef33a8fd7e89db05ab5232bdd8ee0e2e1e106a1ce8801d0","last_reissued_at":"2026-05-18T02:46:39.028588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:39.028588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Streaming Algorithms for Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Graham Cormode, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Rajesh Chitnis","submitted_at":"2014-05-01T04:40:11Z","abstract_excerpt":"As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams.\n  In this paper, we introduce a new approach to handling graph streams, by instead seeking solutions for the parameterized versions of these problems where we are given a parameter $k$ and the objective is to decide whether there is a solution bounded by $k$. By combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0093","kind":"arxiv","version":2},"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":"1405.0093","created_at":"2026-05-18T02:46:39.028675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0093v2","created_at":"2026-05-18T02:46:39.028675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0093","created_at":"2026-05-18T02:46:39.028675+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5GWS347NVGN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5GWS347NVGNKHXT","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5GWS347","created_at":"2026-05-18T12:28:38.356838+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/M5GWS347NVGNKHXTHKH5P2E5WB","json":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB.json","graph_json":"https://pith.science/api/pith-number/M5GWS347NVGNKHXTHKH5P2E5WB/graph.json","events_json":"https://pith.science/api/pith-number/M5GWS347NVGNKHXTHKH5P2E5WB/events.json","paper":"https://pith.science/paper/M5GWS347"},"agent_actions":{"view_html":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB","download_json":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB.json","view_paper":"https://pith.science/paper/M5GWS347","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0093&json=true","fetch_graph":"https://pith.science/api/pith-number/M5GWS347NVGNKHXTHKH5P2E5WB/graph.json","fetch_events":"https://pith.science/api/pith-number/M5GWS347NVGNKHXTHKH5P2E5WB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB/action/storage_attestation","attest_author":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB/action/author_attestation","sign_citation":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB/action/citation_signature","submit_replication":"https://pith.science/pith/M5GWS347NVGNKHXTHKH5P2E5WB/action/replication_record"}},"created_at":"2026-05-18T02:46:39.028675+00:00","updated_at":"2026-05-18T02:46:39.028675+00:00"}