{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PIGCSKD7TYLFEX5L2V2T4ACFXB","short_pith_number":"pith:PIGCSKD7","schema_version":"1.0","canonical_sha256":"7a0c29287f9e16525fabd5753e0045b85f3136f1ce5549838a00acf3f17e8353","source":{"kind":"arxiv","id":"2305.01714","version":1},"attestation_state":"computed","paper":{"title":"Streaming Edge Coloring with Asymptotically Optimal Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohammad Saneian, Soheil Behnezhad","submitted_at":"2023-05-02T18:27:26Z","abstract_excerpt":"Given a graph $G$, an edge-coloring is an assignment of colors to edges of $G$ such that any two edges sharing an endpoint receive different colors. By Vizing's celebrated theorem, any graph of maximum degree $\\Delta$ needs at least $\\Delta$ and at most $(\\Delta + 1)$ colors to be properly edge colored. In this paper, we study edge colorings in the streaming setting. The edges arrive one by one in an arbitrary order. The algorithm takes a single pass over the input and must output a solution using a much smaller space than the input size. Since the output of edge coloring is as large as its in"},"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":"2305.01714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-05-02T18:27:26Z","cross_cats_sorted":[],"title_canon_sha256":"ccc808055cb41e9850a7416e52dd57bff661615eefaa85a15cf9ecabfcbafc49","abstract_canon_sha256":"880aa12976cee3b882a22b8b59ca63ebaf3054f49f972541e336620b080232b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:31.133023Z","signature_b64":"qMBBqnG1ZPVRfQQjV7Tsi2KhT/C+ZyLmjGvftJ3hCR23rkDk7g5oBUFMi70Y3QHxucFzwlZtqNMQaGsxTYtnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a0c29287f9e16525fabd5753e0045b85f3136f1ce5549838a00acf3f17e8353","last_reissued_at":"2026-07-05T06:06:31.132609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:31.132609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Edge Coloring with Asymptotically Optimal Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohammad Saneian, Soheil Behnezhad","submitted_at":"2023-05-02T18:27:26Z","abstract_excerpt":"Given a graph $G$, an edge-coloring is an assignment of colors to edges of $G$ such that any two edges sharing an endpoint receive different colors. By Vizing's celebrated theorem, any graph of maximum degree $\\Delta$ needs at least $\\Delta$ and at most $(\\Delta + 1)$ colors to be properly edge colored. In this paper, we study edge colorings in the streaming setting. The edges arrive one by one in an arbitrary order. The algorithm takes a single pass over the input and must output a solution using a much smaller space than the input size. Since the output of edge coloring is as large as its in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01714","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.01714/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.01714","created_at":"2026-07-05T06:06:31.132674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01714v1","created_at":"2026-07-05T06:06:31.132674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01714","created_at":"2026-07-05T06:06:31.132674+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIGCSKD7TYLF","created_at":"2026-07-05T06:06:31.132674+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIGCSKD7TYLFEX5L","created_at":"2026-07-05T06:06:31.132674+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIGCSKD7","created_at":"2026-07-05T06:06:31.132674+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/PIGCSKD7TYLFEX5L2V2T4ACFXB","json":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB.json","graph_json":"https://pith.science/api/pith-number/PIGCSKD7TYLFEX5L2V2T4ACFXB/graph.json","events_json":"https://pith.science/api/pith-number/PIGCSKD7TYLFEX5L2V2T4ACFXB/events.json","paper":"https://pith.science/paper/PIGCSKD7"},"agent_actions":{"view_html":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB","download_json":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB.json","view_paper":"https://pith.science/paper/PIGCSKD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01714&json=true","fetch_graph":"https://pith.science/api/pith-number/PIGCSKD7TYLFEX5L2V2T4ACFXB/graph.json","fetch_events":"https://pith.science/api/pith-number/PIGCSKD7TYLFEX5L2V2T4ACFXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB/action/storage_attestation","attest_author":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB/action/author_attestation","sign_citation":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB/action/citation_signature","submit_replication":"https://pith.science/pith/PIGCSKD7TYLFEX5L2V2T4ACFXB/action/replication_record"}},"created_at":"2026-07-05T06:06:31.132674+00:00","updated_at":"2026-07-05T06:06:31.132674+00:00"}