{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W5LX7XLEST35PSJMZF6ECW4UNW","short_pith_number":"pith:W5LX7XLE","schema_version":"1.0","canonical_sha256":"b7577fdd6494f7d7c92cc97c415b946d95f1213e76bef0cc7137629c58082e8f","source":{"kind":"arxiv","id":"1807.07640","version":2},"attestation_state":"computed","paper":{"title":"Coloring in Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Prantar Ghosh, Suman Kalyan Bera","submitted_at":"2018-07-19T21:02:10Z","abstract_excerpt":"In this paper, we initiate the study of the vertex coloring problem of a graph in the semi streaming model. In this model, the input graph is defined by a stream of edges, arriving in adversarial order and any algorithm must process the edges in the order of arrival using space linear (up to polylogarithmic factors) in the number of vertices of the graph. In the offline settings, there is a simple greedy algorithm for $(\\Delta+1)$-vertex coloring of a graph with maximum degree $\\Delta$. We design a one pass randomized streaming algorithm for $(1+\\varepsilon)\\Delta$-vertex coloring problem for "},"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":"1807.07640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T21:02:10Z","cross_cats_sorted":[],"title_canon_sha256":"6d2233315fa88073a3591aba337421421241f1fccb2121904ae720e4cd5755d9","abstract_canon_sha256":"1e647c7dcf1e5d2c92e6b9d559953b78d5c0317befd82aed73e24f9c01a285a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:51.910444Z","signature_b64":"IEHCfCzcOJm9n1Yeztk6lPAgTLrJ3XHigrRMPjxHT5Kz+AQryjyRl8PdAgwzFSxPOnpMWaSO6UEg2KVR4Cv+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7577fdd6494f7d7c92cc97c415b946d95f1213e76bef0cc7137629c58082e8f","last_reissued_at":"2026-05-18T00:09:51.909859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:51.909859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring in Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Prantar Ghosh, Suman Kalyan Bera","submitted_at":"2018-07-19T21:02:10Z","abstract_excerpt":"In this paper, we initiate the study of the vertex coloring problem of a graph in the semi streaming model. In this model, the input graph is defined by a stream of edges, arriving in adversarial order and any algorithm must process the edges in the order of arrival using space linear (up to polylogarithmic factors) in the number of vertices of the graph. In the offline settings, there is a simple greedy algorithm for $(\\Delta+1)$-vertex coloring of a graph with maximum degree $\\Delta$. We design a one pass randomized streaming algorithm for $(1+\\varepsilon)\\Delta$-vertex coloring problem for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07640","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":"1807.07640","created_at":"2026-05-18T00:09:51.909934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07640v2","created_at":"2026-05-18T00:09:51.909934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07640","created_at":"2026-05-18T00:09:51.909934+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5LX7XLEST35","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5LX7XLEST35PSJM","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5LX7XLE","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.07644","citing_title":"Faster Deterministic Streaming Vertex Coloring","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW","json":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW.json","graph_json":"https://pith.science/api/pith-number/W5LX7XLEST35PSJMZF6ECW4UNW/graph.json","events_json":"https://pith.science/api/pith-number/W5LX7XLEST35PSJMZF6ECW4UNW/events.json","paper":"https://pith.science/paper/W5LX7XLE"},"agent_actions":{"view_html":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW","download_json":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW.json","view_paper":"https://pith.science/paper/W5LX7XLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07640&json=true","fetch_graph":"https://pith.science/api/pith-number/W5LX7XLEST35PSJMZF6ECW4UNW/graph.json","fetch_events":"https://pith.science/api/pith-number/W5LX7XLEST35PSJMZF6ECW4UNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW/action/storage_attestation","attest_author":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW/action/author_attestation","sign_citation":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW/action/citation_signature","submit_replication":"https://pith.science/pith/W5LX7XLEST35PSJMZF6ECW4UNW/action/replication_record"}},"created_at":"2026-05-18T00:09:51.909934+00:00","updated_at":"2026-05-18T00:09:51.909934+00:00"}