{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JDW4YM2TTS3RYEOG3R2J3XQZ3Z","short_pith_number":"pith:JDW4YM2T","schema_version":"1.0","canonical_sha256":"48edcc33539cb71c11c6dc749dde19de78dd1c55c78a03d790ea6ad9b2c31e74","source":{"kind":"arxiv","id":"1610.05839","version":1},"attestation_state":"computed","paper":{"title":"Cycles with two blocks in $k$-chromatic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Jie Ma, Ringi Kim, Seog-Jin Kim","submitted_at":"2016-10-19T01:36:06Z","abstract_excerpt":"Let $k$ and $\\ell$ be positive integers. A cycle with two blocks $c(k,\\ell)$ is an oriented cycle which consists of two internally (vertex) disjoint directed paths of lengths at least $k$ and $\\ell$, respectively, from a vertex to another one. A problem of Addario-Berry, Havet and Thomass\\'e (2007) asked if, given positive integers $k$ and $\\ell$ such that $k+\\ell\\ge 4$, any strongly connected digraph $D$ containing no $c(k,\\ell)$ has chromatic number at most $k+\\ell-1$. In this paper, we show that such digraph $D$ has chromatic number at most $O((k+\\ell)^2)$, improving the previous upper boun"},"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":"1610.05839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-19T01:36:06Z","cross_cats_sorted":[],"title_canon_sha256":"5bf5943f2cd67c65e39cc51bc247122828b46789c6bf7e09409e1187b52f5e32","abstract_canon_sha256":"7d606b10bf85586e9a5765257acbe005e059d213f95ec06da2f3391f1ba51d05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:50.988303Z","signature_b64":"zJGfQLoDwl8hWixW63B3am/Ue27I2jLsPIFSfhi/Ot9BOzgzEj2gCEdDeA/yS3oiTLi7fWqCR+c225Xri0A5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48edcc33539cb71c11c6dc749dde19de78dd1c55c78a03d790ea6ad9b2c31e74","last_reissued_at":"2026-05-18T01:01:50.987636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:50.987636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycles with two blocks in $k$-chromatic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Jie Ma, Ringi Kim, Seog-Jin Kim","submitted_at":"2016-10-19T01:36:06Z","abstract_excerpt":"Let $k$ and $\\ell$ be positive integers. A cycle with two blocks $c(k,\\ell)$ is an oriented cycle which consists of two internally (vertex) disjoint directed paths of lengths at least $k$ and $\\ell$, respectively, from a vertex to another one. A problem of Addario-Berry, Havet and Thomass\\'e (2007) asked if, given positive integers $k$ and $\\ell$ such that $k+\\ell\\ge 4$, any strongly connected digraph $D$ containing no $c(k,\\ell)$ has chromatic number at most $k+\\ell-1$. In this paper, we show that such digraph $D$ has chromatic number at most $O((k+\\ell)^2)$, improving the previous upper boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05839","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":""},"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":"1610.05839","created_at":"2026-05-18T01:01:50.987753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05839v1","created_at":"2026-05-18T01:01:50.987753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05839","created_at":"2026-05-18T01:01:50.987753+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDW4YM2TTS3R","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDW4YM2TTS3RYEOG","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDW4YM2T","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z","json":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z.json","graph_json":"https://pith.science/api/pith-number/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/graph.json","events_json":"https://pith.science/api/pith-number/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/events.json","paper":"https://pith.science/paper/JDW4YM2T"},"agent_actions":{"view_html":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z","download_json":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z.json","view_paper":"https://pith.science/paper/JDW4YM2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05839&json=true","fetch_graph":"https://pith.science/api/pith-number/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/action/storage_attestation","attest_author":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/action/author_attestation","sign_citation":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/action/citation_signature","submit_replication":"https://pith.science/pith/JDW4YM2TTS3RYEOG3R2J3XQZ3Z/action/replication_record"}},"created_at":"2026-05-18T01:01:50.987753+00:00","updated_at":"2026-05-18T01:01:50.987753+00:00"}