{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LM2PPMMWFZ7C26SRB5JBLLVQS4","short_pith_number":"pith:LM2PPMMW","schema_version":"1.0","canonical_sha256":"5b34f7b1962e7e2d7a510f5215aeb0972f3ad1948ca95668405fc17ca41a2b14","source":{"kind":"arxiv","id":"1804.04787","version":1},"attestation_state":"computed","paper":{"title":"Unavoidable Subtournaments in Tournaments with Large Chromatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilhee Kim, Ringi Kim","submitted_at":"2018-04-13T04:20:37Z","abstract_excerpt":"For a set H of tournaments, we say H is heroic if every tournament, not containing any member of H as a subtournament, has bounded chromatic number. Berger et al. explicitly characterized all heroic sets containing one tournament. Motivated by this result, we study heroic sets containing two tournaments. We give a necessary condition for a set containing two tournaments to be heroic. We also construct infinitely many minimal heroic sets of size two."},"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":"1804.04787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-13T04:20:37Z","cross_cats_sorted":[],"title_canon_sha256":"952600b3e67981f11af2da54dba0355c43d5bd1fbdc63cdedb3b24b5b4b653ff","abstract_canon_sha256":"9e6f3e17488a47048217ae39b3f5781aad55a62b0426a62d4acdf8336d447dc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:34.987403Z","signature_b64":"HB5Txn7goarZUkCf386PBXce07uXSgbAQvDYS3MJ5pMrz6YNjprtMcE2wEHiobERgiro6QXrUmez0BPsYQ1cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b34f7b1962e7e2d7a510f5215aeb0972f3ad1948ca95668405fc17ca41a2b14","last_reissued_at":"2026-05-18T00:18:34.986721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:34.986721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unavoidable Subtournaments in Tournaments with Large Chromatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilhee Kim, Ringi Kim","submitted_at":"2018-04-13T04:20:37Z","abstract_excerpt":"For a set H of tournaments, we say H is heroic if every tournament, not containing any member of H as a subtournament, has bounded chromatic number. Berger et al. explicitly characterized all heroic sets containing one tournament. Motivated by this result, we study heroic sets containing two tournaments. We give a necessary condition for a set containing two tournaments to be heroic. We also construct infinitely many minimal heroic sets of size two."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04787","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":"1804.04787","created_at":"2026-05-18T00:18:34.986804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04787v1","created_at":"2026-05-18T00:18:34.986804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04787","created_at":"2026-05-18T00:18:34.986804+00:00"},{"alias_kind":"pith_short_12","alias_value":"LM2PPMMWFZ7C","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LM2PPMMWFZ7C26SR","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LM2PPMMW","created_at":"2026-05-18T12:32:37.024351+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/LM2PPMMWFZ7C26SRB5JBLLVQS4","json":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4.json","graph_json":"https://pith.science/api/pith-number/LM2PPMMWFZ7C26SRB5JBLLVQS4/graph.json","events_json":"https://pith.science/api/pith-number/LM2PPMMWFZ7C26SRB5JBLLVQS4/events.json","paper":"https://pith.science/paper/LM2PPMMW"},"agent_actions":{"view_html":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4","download_json":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4.json","view_paper":"https://pith.science/paper/LM2PPMMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04787&json=true","fetch_graph":"https://pith.science/api/pith-number/LM2PPMMWFZ7C26SRB5JBLLVQS4/graph.json","fetch_events":"https://pith.science/api/pith-number/LM2PPMMWFZ7C26SRB5JBLLVQS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4/action/storage_attestation","attest_author":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4/action/author_attestation","sign_citation":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4/action/citation_signature","submit_replication":"https://pith.science/pith/LM2PPMMWFZ7C26SRB5JBLLVQS4/action/replication_record"}},"created_at":"2026-05-18T00:18:34.986804+00:00","updated_at":"2026-05-18T00:18:34.986804+00:00"}