{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:F46TKG3FLQ2QXSA4QLXPVZUN64","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"912441f60887544559b02200bdbc6784908b5a6e8ec1b08f2d51370b9d5fc718","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T08:13:43Z","title_canon_sha256":"fa93970403c82b9b4885b330480812d107ae5dc2c28940bfc4bff2e10bfe7c22"},"schema_version":"1.0","source":{"id":"2607.26592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26592","created_at":"2026-07-30T01:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26592v1","created_at":"2026-07-30T01:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26592","created_at":"2026-07-30T01:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"F46TKG3FLQ2Q","created_at":"2026-07-30T01:21:26Z"},{"alias_kind":"pith_short_16","alias_value":"F46TKG3FLQ2QXSA4","created_at":"2026-07-30T01:21:26Z"},{"alias_kind":"pith_short_8","alias_value":"F46TKG3F","created_at":"2026-07-30T01:21:26Z"}],"graph_snapshots":[{"event_id":"sha256:c9ffabf8c22ad46c36d55a9754b9ac1e00822dd52c1277b217e97809480db618","target":"graph","created_at":"2026-07-30T01:21:26Z","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/2607.26592/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph $k$-coloring is one of the classic NP-complete problems. Previous work has studied its average time complexity, defined to be the average runtime of computing a $k$-coloring over the set of all $k$-colorable graphs on $n$ vertices. A highly influential result of Dyer-Frieze from 1989 gave an algorithm with $O(n^2)$ average runtime for constant $k$. This quadratic runtime appeared natural (and possibly even optimal) since almost all $k$-colorable graphs have $\\Theta(n^2)$ edges, so one needs at least this time in order to read the (entire) input. However, this was later improved by Ku\\v{c","authors_text":"Asaf Shapira, Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Shlomo Tauber","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26592","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:e09c973b264f71758fe3dcb96f20a2ba2aa89a817b153c0be1265b7ee2dea7ba","target":"record","created_at":"2026-07-30T01:21:26Z","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":"912441f60887544559b02200bdbc6784908b5a6e8ec1b08f2d51370b9d5fc718","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T08:13:43Z","title_canon_sha256":"fa93970403c82b9b4885b330480812d107ae5dc2c28940bfc4bff2e10bfe7c22"},"schema_version":"1.0","source":{"id":"2607.26592","kind":"arxiv","version":1}},"canonical_sha256":"2f3d351b655c350bc81c82eefae68df7265ebf50ea3d95db39827124021c201e","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f3d351b655c350bc81c82eefae68df7265ebf50ea3d95db39827124021c201e","first_computed_at":"2026-07-30T01:21:26.128893Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:21:26.128893Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e09c973b264f71758fe3dcb96f20a2ba2aa89a817b153c0be1265b7ee2dea7ba","sha256:c9ffabf8c22ad46c36d55a9754b9ac1e00822dd52c1277b217e97809480db618","sha256:db4177cccf1265ba8bcea0fadea316b659264860b0cd00a370ca34ef7dca303c"],"state_sha256":"8aab99ff474b5a7103c01f4bad191020ac4ce40e626ee02ea357c576b466ad75"}