{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AYDIILWBW7ZUIIYRWO6FCUINGI","short_pith_number":"pith:AYDIILWB","schema_version":"1.0","canonical_sha256":"0606842ec1b7f3442311b3bc51510d320231273320f8371b987b66cc03e1cf8a","source":{"kind":"arxiv","id":"2102.07089","version":1},"attestation_state":"computed","paper":{"title":"Simple vertex coloring algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Fang Song, Jackson Morris","submitted_at":"2021-02-14T07:27:10Z","abstract_excerpt":"Given a graph $G$ with $n$ vertices and maximum degree $\\Delta$, it is known that $G$ admits a vertex coloring with $\\Delta + 1$ colors such that no edge of $G$ is monochromatic. This can be seen constructively by a simple greedy algorithm, which runs in time $O(n\\Delta)$.\n  Very recently, a sequence of results (e.g., [Assadi et. al. SODA'19, Bera et. al. ICALP'20, Alon Assadi Approx/Random'20]) show randomized algorithms for $(\\epsilon + 1)\\Delta$-coloring in the query model making $\\tilde{O}(n\\sqrt{n})$ queries, improving over the greedy strategy on dense graphs. In addition, a lower bound o"},"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":"2102.07089","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-02-14T07:27:10Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"100b33df1deb0284a8c41ce08913b37c189350e95cfe9f412d426946b5c7eb1b","abstract_canon_sha256":"6de723a1c10ca16c6dbcb5fbbb124968feccb49c192a91fe207b0e0bb883504c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:01.174837Z","signature_b64":"W1UjyYBJ32jlQMFo9rAJsaEV0UX7+n1hibuGZIJ8jBje7qTyfv0Y+Qix7OOwCC5wW45UK3k8yPr/HuhsrBHiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0606842ec1b7f3442311b3bc51510d320231273320f8371b987b66cc03e1cf8a","last_reissued_at":"2026-07-05T02:15:01.174366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:01.174366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple vertex coloring algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Fang Song, Jackson Morris","submitted_at":"2021-02-14T07:27:10Z","abstract_excerpt":"Given a graph $G$ with $n$ vertices and maximum degree $\\Delta$, it is known that $G$ admits a vertex coloring with $\\Delta + 1$ colors such that no edge of $G$ is monochromatic. This can be seen constructively by a simple greedy algorithm, which runs in time $O(n\\Delta)$.\n  Very recently, a sequence of results (e.g., [Assadi et. al. SODA'19, Bera et. al. ICALP'20, Alon Assadi Approx/Random'20]) show randomized algorithms for $(\\epsilon + 1)\\Delta$-coloring in the query model making $\\tilde{O}(n\\sqrt{n})$ queries, improving over the greedy strategy on dense graphs. In addition, a lower bound o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07089","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/2102.07089/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":"2102.07089","created_at":"2026-07-05T02:15:01.174431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07089v1","created_at":"2026-07-05T02:15:01.174431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07089","created_at":"2026-07-05T02:15:01.174431+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYDIILWBW7ZU","created_at":"2026-07-05T02:15:01.174431+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYDIILWBW7ZUIIYR","created_at":"2026-07-05T02:15:01.174431+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYDIILWB","created_at":"2026-07-05T02:15:01.174431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21380","citing_title":"Modeling and Resource Optimization for Quantum Oracles","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI","json":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI.json","graph_json":"https://pith.science/api/pith-number/AYDIILWBW7ZUIIYRWO6FCUINGI/graph.json","events_json":"https://pith.science/api/pith-number/AYDIILWBW7ZUIIYRWO6FCUINGI/events.json","paper":"https://pith.science/paper/AYDIILWB"},"agent_actions":{"view_html":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI","download_json":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI.json","view_paper":"https://pith.science/paper/AYDIILWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07089&json=true","fetch_graph":"https://pith.science/api/pith-number/AYDIILWBW7ZUIIYRWO6FCUINGI/graph.json","fetch_events":"https://pith.science/api/pith-number/AYDIILWBW7ZUIIYRWO6FCUINGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI/action/storage_attestation","attest_author":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI/action/author_attestation","sign_citation":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI/action/citation_signature","submit_replication":"https://pith.science/pith/AYDIILWBW7ZUIIYRWO6FCUINGI/action/replication_record"}},"created_at":"2026-07-05T02:15:01.174431+00:00","updated_at":"2026-07-05T02:15:01.174431+00:00"}