{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5TMVSJV7QPYKVWSD5GHIICYFD7","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":"abc7ac9e6f4e4f82bddb88c7f056580f53e3342cacdace1bc8380734984de606","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-04T16:56:47Z","title_canon_sha256":"17b67ed958a8d79d52aadaba6e25ef2316c3f75de5100dab41713c55b164dd5c"},"schema_version":"1.0","source":{"id":"2006.03009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.03009","created_at":"2026-07-05T01:08:02Z"},{"alias_kind":"arxiv_version","alias_value":"2006.03009v1","created_at":"2026-07-05T01:08:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03009","created_at":"2026-07-05T01:08:02Z"},{"alias_kind":"pith_short_12","alias_value":"5TMVSJV7QPYK","created_at":"2026-07-05T01:08:02Z"},{"alias_kind":"pith_short_16","alias_value":"5TMVSJV7QPYKVWSD","created_at":"2026-07-05T01:08:02Z"},{"alias_kind":"pith_short_8","alias_value":"5TMVSJV7","created_at":"2026-07-05T01:08:02Z"}],"graph_snapshots":[{"event_id":"sha256:9ba77acafcb93e670433fe2f8aa1656ccc7e88055de58ac1ca985a65d179789d","target":"graph","created_at":"2026-07-05T01:08:02Z","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/2006.03009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $s$ and $t$ be positive integers. We use $P_t$ to denote the path with $t$ vertices and $K_{1,s}$ to denote the complete bipartite graph with parts of size $1$ and $s$ respectively. The one-subdivision of $K_{1,s}$ is obtained by replacing every edge $\\{u,v\\}$ of $K_{1,s}$ by two edges $\\{u,w\\}$ and $\\{v,w\\}$ with a new vertex $w$. In this paper, we give a polynomial-time algorithm for the list-three-coloring problem restricted to the class of $P_t$-free graph with no induced 1-subdivision of $K_{1,s}$.","authors_text":"Maria Chudnovsky, Mingxian Zhong, Sophie Spirkl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-04T16:56:47Z","title":"List-three-coloring $ P_t $-free graphs with no induced 1-subdivision of $ K_{1,s} $"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03009","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:57be7cce6279e20afc10a93f9dd8d41b4c864ee8d9f0a0791bb8b0b3271cd511","target":"record","created_at":"2026-07-05T01:08:02Z","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":"abc7ac9e6f4e4f82bddb88c7f056580f53e3342cacdace1bc8380734984de606","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-04T16:56:47Z","title_canon_sha256":"17b67ed958a8d79d52aadaba6e25ef2316c3f75de5100dab41713c55b164dd5c"},"schema_version":"1.0","source":{"id":"2006.03009","kind":"arxiv","version":1}},"canonical_sha256":"ecd95926bf83f0aada43e98e840b051ff87f15ed285f752eb977576b4ff39b88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecd95926bf83f0aada43e98e840b051ff87f15ed285f752eb977576b4ff39b88","first_computed_at":"2026-07-05T01:08:02.445921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:02.445921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0xHthjhlYpjupUBzbfVbBJFCppOOqibsfl2o0b54DThM87UkHzaUEq+MV9YcfGUumiXdU/ZvYKzUVYH5JKHAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:02.446357Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.03009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57be7cce6279e20afc10a93f9dd8d41b4c864ee8d9f0a0791bb8b0b3271cd511","sha256:9ba77acafcb93e670433fe2f8aa1656ccc7e88055de58ac1ca985a65d179789d"],"state_sha256":"cbe3547252978974152115ec55581777ad8f22867209f57499a690892c273871"}