{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5TMVSJV7QPYKVWSD5GHIICYFD7","short_pith_number":"pith:5TMVSJV7","schema_version":"1.0","canonical_sha256":"ecd95926bf83f0aada43e98e840b051ff87f15ed285f752eb977576b4ff39b88","source":{"kind":"arxiv","id":"2006.03009","version":1},"attestation_state":"computed","paper":{"title":"List-three-coloring $ P_t $-free graphs with no induced 1-subdivision of $ K_{1,s} $","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Mingxian Zhong, Sophie Spirkl","submitted_at":"2020-06-04T16:56:47Z","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}$."},"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":"2006.03009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-04T16:56:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"17b67ed958a8d79d52aadaba6e25ef2316c3f75de5100dab41713c55b164dd5c","abstract_canon_sha256":"abc7ac9e6f4e4f82bddb88c7f056580f53e3342cacdace1bc8380734984de606"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:02.446357Z","signature_b64":"Z0xHthjhlYpjupUBzbfVbBJFCppOOqibsfl2o0b54DThM87UkHzaUEq+MV9YcfGUumiXdU/ZvYKzUVYH5JKHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd95926bf83f0aada43e98e840b051ff87f15ed285f752eb977576b4ff39b88","last_reissued_at":"2026-07-05T01:08:02.445921Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:02.445921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-three-coloring $ P_t $-free graphs with no induced 1-subdivision of $ K_{1,s} $","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Mingxian Zhong, Sophie Spirkl","submitted_at":"2020-06-04T16:56:47Z","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}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03009","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/2006.03009/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":"2006.03009","created_at":"2026-07-05T01:08:02.445984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.03009v1","created_at":"2026-07-05T01:08:02.445984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03009","created_at":"2026-07-05T01:08:02.445984+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TMVSJV7QPYK","created_at":"2026-07-05T01:08:02.445984+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TMVSJV7QPYKVWSD","created_at":"2026-07-05T01:08:02.445984+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TMVSJV7","created_at":"2026-07-05T01:08:02.445984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07484","citing_title":"A New Scaling Law for Non-Dipolar Magnetic Fields in Rapidly Rotating Stars and Planets","ref_index":95,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7","json":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7.json","graph_json":"https://pith.science/api/pith-number/5TMVSJV7QPYKVWSD5GHIICYFD7/graph.json","events_json":"https://pith.science/api/pith-number/5TMVSJV7QPYKVWSD5GHIICYFD7/events.json","paper":"https://pith.science/paper/5TMVSJV7"},"agent_actions":{"view_html":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7","download_json":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7.json","view_paper":"https://pith.science/paper/5TMVSJV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.03009&json=true","fetch_graph":"https://pith.science/api/pith-number/5TMVSJV7QPYKVWSD5GHIICYFD7/graph.json","fetch_events":"https://pith.science/api/pith-number/5TMVSJV7QPYKVWSD5GHIICYFD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7/action/storage_attestation","attest_author":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7/action/author_attestation","sign_citation":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7/action/citation_signature","submit_replication":"https://pith.science/pith/5TMVSJV7QPYKVWSD5GHIICYFD7/action/replication_record"}},"created_at":"2026-07-05T01:08:02.445984+00:00","updated_at":"2026-07-05T01:08:02.445984+00:00"}