{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PDUCDEMLYE6VE475QPVFNNIEQN","short_pith_number":"pith:PDUCDEML","schema_version":"1.0","canonical_sha256":"78e821918bc13d5273fd83ea56b5048375790a1ffb987d35bd65ff11db24e6e0","source":{"kind":"arxiv","id":"2502.06024","version":1},"attestation_state":"computed","paper":{"title":"Improved Sublinear Algorithms for Classical and Quantum Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Ferber, Liam Hardiman, Xiaonan Chen","submitted_at":"2025-02-09T20:40:54Z","abstract_excerpt":"We present three sublinear randomized algorithms for vertex-coloring of graphs with maximum degree $\\Delta$. The first is a simple algorithm that extends the idea of Morris and Song to color graphs with maximum degree $\\Delta$ using $\\Delta+1$ colors. Combined with the greedy algorithm, it achieves an expected runtime of $O(n^{3/2}\\sqrt{\\log n})$ in the query model, improving on Assadi, Chen, and Khanna's algorithm by a $\\sqrt{\\log n}$ factor in expectation. When we allow quantum queries to the graph, we can accelerate the first algorithm using Grover's famous algorithm, resulting in a runtime"},"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":"2502.06024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T20:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"bee831bfb4a1fad9137c3e7437ac72feac9f0bb994fe7c90d03ae716e64b1c71","abstract_canon_sha256":"1da833f4437dbf1d852ee52d340f7dba725f83dd6b6f72bd00a3f19169e81cca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:46.587374Z","signature_b64":"Ug+ZrAWASF4Hzbg6vdm3Clwtbcw8uavJJktYKZDXCTV6fJmkXW4Fv+pHBZ+cpuA8Cp3Ij1thS6ANPTRgNeYMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78e821918bc13d5273fd83ea56b5048375790a1ffb987d35bd65ff11db24e6e0","last_reissued_at":"2026-07-05T10:11:46.586885Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:46.586885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Sublinear Algorithms for Classical and Quantum Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Ferber, Liam Hardiman, Xiaonan Chen","submitted_at":"2025-02-09T20:40:54Z","abstract_excerpt":"We present three sublinear randomized algorithms for vertex-coloring of graphs with maximum degree $\\Delta$. The first is a simple algorithm that extends the idea of Morris and Song to color graphs with maximum degree $\\Delta$ using $\\Delta+1$ colors. Combined with the greedy algorithm, it achieves an expected runtime of $O(n^{3/2}\\sqrt{\\log n})$ in the query model, improving on Assadi, Chen, and Khanna's algorithm by a $\\sqrt{\\log n}$ factor in expectation. When we allow quantum queries to the graph, we can accelerate the first algorithm using Grover's famous algorithm, resulting in a runtime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06024","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/2502.06024/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":"2502.06024","created_at":"2026-07-05T10:11:46.586943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06024v1","created_at":"2026-07-05T10:11:46.586943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06024","created_at":"2026-07-05T10:11:46.586943+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDUCDEMLYE6V","created_at":"2026-07-05T10:11:46.586943+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDUCDEMLYE6VE475","created_at":"2026-07-05T10:11:46.586943+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDUCDEML","created_at":"2026-07-05T10:11:46.586943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20648","citing_title":"Fully Dynamic Algorithms for Coloring Triangle-Free Graphs","ref_index":81,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN","json":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN.json","graph_json":"https://pith.science/api/pith-number/PDUCDEMLYE6VE475QPVFNNIEQN/graph.json","events_json":"https://pith.science/api/pith-number/PDUCDEMLYE6VE475QPVFNNIEQN/events.json","paper":"https://pith.science/paper/PDUCDEML"},"agent_actions":{"view_html":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN","download_json":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN.json","view_paper":"https://pith.science/paper/PDUCDEML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06024&json=true","fetch_graph":"https://pith.science/api/pith-number/PDUCDEMLYE6VE475QPVFNNIEQN/graph.json","fetch_events":"https://pith.science/api/pith-number/PDUCDEMLYE6VE475QPVFNNIEQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/action/storage_attestation","attest_author":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/action/author_attestation","sign_citation":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/action/citation_signature","submit_replication":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/action/replication_record"}},"created_at":"2026-07-05T10:11:46.586943+00:00","updated_at":"2026-07-05T10:11:46.586943+00:00"}