{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PDUCDEMLYE6VE475QPVFNNIEQN","short_pith_number":"pith:PDUCDEML","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"},"canonical_sha256":"78e821918bc13d5273fd83ea56b5048375790a1ffb987d35bd65ff11db24e6e0","source":{"kind":"arxiv","id":"2502.06024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06024","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06024v1","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06024","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"PDUCDEMLYE6V","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"PDUCDEMLYE6VE475","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"PDUCDEML","created_at":"2026-07-05T10:11:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PDUCDEMLYE6VE475QPVFNNIEQN","target":"record","payload":{"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"},"canonical_sha256":"78e821918bc13d5273fd83ea56b5048375790a1ffb987d35bd65ff11db24e6e0","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"},"source_kind":"arxiv","source_id":"2502.06024","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUsyBsI6oWBca/FSzWkTocjAyIGugmsLCpaF48IXK/fCNdKb3hMpjH/P4sg27UMG6CkHC+fvozYr/xvr7EjgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:05:35.811415Z"},"content_sha256":"9730c60eb00e20e88f7ea44cecb08b3c99e5f47783969a8c3b6db7a83adc6514","schema_version":"1.0","event_id":"sha256:9730c60eb00e20e88f7ea44cecb08b3c99e5f47783969a8c3b6db7a83adc6514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PDUCDEMLYE6VE475QPVFNNIEQN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mx0o6qRthkLcVc3gQTMiG3YbsJiqc7yyRVpm2qFgKlkL5rVhsL03YilpzqQqn6dy1FSY9iHgNPzSK6jQYn+sBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T11:05:35.812373Z"},"content_sha256":"3065ada5caae2e7b88b6680c99d36e702248896aa368db7744b57ff647963afd","schema_version":"1.0","event_id":"sha256:3065ada5caae2e7b88b6680c99d36e702248896aa368db7744b57ff647963afd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/bundle.json","state_url":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDUCDEMLYE6VE475QPVFNNIEQN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T11:05:35Z","links":{"resolver":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN","bundle":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/bundle.json","state":"https://pith.science/pith/PDUCDEMLYE6VE475QPVFNNIEQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDUCDEMLYE6VE475QPVFNNIEQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PDUCDEMLYE6VE475QPVFNNIEQN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1da833f4437dbf1d852ee52d340f7dba725f83dd6b6f72bd00a3f19169e81cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T20:40:54Z","title_canon_sha256":"bee831bfb4a1fad9137c3e7437ac72feac9f0bb994fe7c90d03ae716e64b1c71"},"schema_version":"1.0","source":{"id":"2502.06024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06024","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06024v1","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06024","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"PDUCDEMLYE6V","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"PDUCDEMLYE6VE475","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"PDUCDEML","created_at":"2026-07-05T10:11:46Z"}],"graph_snapshots":[{"event_id":"sha256:3065ada5caae2e7b88b6680c99d36e702248896aa368db7744b57ff647963afd","target":"graph","created_at":"2026-07-05T10:11:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.06024/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Asaf Ferber, Liam Hardiman, Xiaonan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T20:40:54Z","title":"Improved Sublinear Algorithms for Classical and Quantum Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06024","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9730c60eb00e20e88f7ea44cecb08b3c99e5f47783969a8c3b6db7a83adc6514","target":"record","created_at":"2026-07-05T10:11:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1da833f4437dbf1d852ee52d340f7dba725f83dd6b6f72bd00a3f19169e81cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T20:40:54Z","title_canon_sha256":"bee831bfb4a1fad9137c3e7437ac72feac9f0bb994fe7c90d03ae716e64b1c71"},"schema_version":"1.0","source":{"id":"2502.06024","kind":"arxiv","version":1}},"canonical_sha256":"78e821918bc13d5273fd83ea56b5048375790a1ffb987d35bd65ff11db24e6e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78e821918bc13d5273fd83ea56b5048375790a1ffb987d35bd65ff11db24e6e0","first_computed_at":"2026-07-05T10:11:46.586885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:46.586885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ug+ZrAWASF4Hzbg6vdm3Clwtbcw8uavJJktYKZDXCTV6fJmkXW4Fv+pHBZ+cpuA8Cp3Ij1thS6ANPTRgNeYMAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:46.587374Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.06024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9730c60eb00e20e88f7ea44cecb08b3c99e5f47783969a8c3b6db7a83adc6514","sha256:3065ada5caae2e7b88b6680c99d36e702248896aa368db7744b57ff647963afd"],"state_sha256":"b45fd1cec3baebd9fd2340fee29ae73f9abec470846ffed062b474f8497ab873"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSjNaZLdEZNf5soyZaLDWZ0Is0i4myW6h1LK57X53gfGifwCqpEe/U5Akvo7GefXxAZQ24SHgM4boVlR1YM/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T11:05:35.818489Z","bundle_sha256":"fe0e960414de7fba823b52295f0cfd61704f8500f104b8413e44839187ba425f"}}