{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FTRFMWQSGPDXGFED4A5PAFHXAA","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":"11b9596fb8dfd27c34d46820c147d169c8be196fb066565e5380b5bb4bfe3328","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-01-11T20:17:11Z","title_canon_sha256":"4f1bfbdba538f9d535cdbc133627af18d1311303c4bfc65a55ecc66c4989ffa4"},"schema_version":"1.0","source":{"id":"2001.03794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.03794","created_at":"2026-07-05T00:32:56Z"},{"alias_kind":"arxiv_version","alias_value":"2001.03794v1","created_at":"2026-07-05T00:32:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03794","created_at":"2026-07-05T00:32:56Z"},{"alias_kind":"pith_short_12","alias_value":"FTRFMWQSGPDX","created_at":"2026-07-05T00:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"FTRFMWQSGPDXGFED","created_at":"2026-07-05T00:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"FTRFMWQS","created_at":"2026-07-05T00:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:1d3f5478479b94db0a11d02fdd4dddc92d7be9d00a0ac34ea8cebfaeb9f6acbf","target":"graph","created_at":"2026-07-05T00:32:56Z","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/2001.03794/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order $\\sigma$, the smallest available color. The problem Grundy Coloring asks how many colors are needed for the most adversarial vertex ordering $\\sigma$, i.e., the maximum number of colors that the first-fit coloring requires over all possible vertex orderings. Since its inception by Grundy in 1939, Grundy Coloring has been examined for its structural and algorithmic aspects. A brute-force $f(k)n^{2^{k-1}}$-time algorithm for Grundy Coloring on general graphs is not difficult to obtain, where $k$ is t","authors_text":"\\'Edouard Bonnet, Eun Jung Kim, Florian Sikora, Pierre Aboulker","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-01-11T20:17:11Z","title":"Grundy Coloring & friends, Half-Graphs, Bicliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03794","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:05ff1f3a1c6512b3c98920dc70d159857fd031508c051532012729c50e63debc","target":"record","created_at":"2026-07-05T00:32:56Z","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":"11b9596fb8dfd27c34d46820c147d169c8be196fb066565e5380b5bb4bfe3328","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-01-11T20:17:11Z","title_canon_sha256":"4f1bfbdba538f9d535cdbc133627af18d1311303c4bfc65a55ecc66c4989ffa4"},"schema_version":"1.0","source":{"id":"2001.03794","kind":"arxiv","version":1}},"canonical_sha256":"2ce2565a1233c7731483e03af014f7000e6dd636a2697c4eb53e5b926c3d22c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ce2565a1233c7731483e03af014f7000e6dd636a2697c4eb53e5b926c3d22c7","first_computed_at":"2026-07-05T00:32:56.040659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:32:56.040659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gECQBcc6LvEzSw4nZTRwQgb5MN0EslIFY71J2axoTMuD65NhO+FvCBneio7xR7eu1y5ODcCxWePGoK+69tDyDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:32:56.041063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.03794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05ff1f3a1c6512b3c98920dc70d159857fd031508c051532012729c50e63debc","sha256:1d3f5478479b94db0a11d02fdd4dddc92d7be9d00a0ac34ea8cebfaeb9f6acbf"],"state_sha256":"056dc5c5d3fa3316d028b65f3279c1ab25efccf2ebeea224a100d0ff83e540b3"}