{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OSYLKNLDX3TTEBDH6Y3JQVRLC7","short_pith_number":"pith:OSYLKNLD","schema_version":"1.0","canonical_sha256":"74b0b53563bee7320467f63698562b17f120ce0be9ea533678455ec6112841ed","source":{"kind":"arxiv","id":"1708.08891","version":2},"attestation_state":"computed","paper":{"title":"A lower bound on the size of an absorbing set in an arc-coloured tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gena Hahn, Laurent Beaudou, Luc Devroye","submitted_at":"2017-08-29T17:18:28Z","abstract_excerpt":"Bousquet, Lochet and Thomass\\'e recently gave an elegant proof that for any integer $n$, there is a least integer $f(n)$ such that any tournament whose arcs are coloured with $n$ colours contains a subset of vertices $S$ of size $f(n)$ with the property that any vertex not in $S$ admits a monochromatic path to some vertex of $S$. In this note we provide a lower bound on the value $f(n)$."},"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":"1708.08891","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T17:18:28Z","cross_cats_sorted":[],"title_canon_sha256":"a02132017c179c7f287c003d790aa9104bdd27493d6271b62dca6c3d43d04231","abstract_canon_sha256":"a19243eae79b27539ce3369dc290c36ae20db15664c6a2fe5c1227b6def64f73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:18.942832Z","signature_b64":"RSJ+OOuv3PtgGGl/D6RDTTrbRdtSj8Pg8WirK4cjRluAx2J+ohg81vg5iRy0lz8ZmCiZZSbwdUK7QCdvBhfZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74b0b53563bee7320467f63698562b17f120ce0be9ea533678455ec6112841ed","last_reissued_at":"2026-05-18T00:36:18.942079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:18.942079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the size of an absorbing set in an arc-coloured tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gena Hahn, Laurent Beaudou, Luc Devroye","submitted_at":"2017-08-29T17:18:28Z","abstract_excerpt":"Bousquet, Lochet and Thomass\\'e recently gave an elegant proof that for any integer $n$, there is a least integer $f(n)$ such that any tournament whose arcs are coloured with $n$ colours contains a subset of vertices $S$ of size $f(n)$ with the property that any vertex not in $S$ admits a monochromatic path to some vertex of $S$. In this note we provide a lower bound on the value $f(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08891","kind":"arxiv","version":2},"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":"1708.08891","created_at":"2026-05-18T00:36:18.942183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08891v2","created_at":"2026-05-18T00:36:18.942183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08891","created_at":"2026-05-18T00:36:18.942183+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSYLKNLDX3TT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSYLKNLDX3TTEBDH","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSYLKNLD","created_at":"2026-05-18T12:31:34.259226+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/OSYLKNLDX3TTEBDH6Y3JQVRLC7","json":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7.json","graph_json":"https://pith.science/api/pith-number/OSYLKNLDX3TTEBDH6Y3JQVRLC7/graph.json","events_json":"https://pith.science/api/pith-number/OSYLKNLDX3TTEBDH6Y3JQVRLC7/events.json","paper":"https://pith.science/paper/OSYLKNLD"},"agent_actions":{"view_html":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7","download_json":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7.json","view_paper":"https://pith.science/paper/OSYLKNLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08891&json=true","fetch_graph":"https://pith.science/api/pith-number/OSYLKNLDX3TTEBDH6Y3JQVRLC7/graph.json","fetch_events":"https://pith.science/api/pith-number/OSYLKNLDX3TTEBDH6Y3JQVRLC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7/action/storage_attestation","attest_author":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7/action/author_attestation","sign_citation":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7/action/citation_signature","submit_replication":"https://pith.science/pith/OSYLKNLDX3TTEBDH6Y3JQVRLC7/action/replication_record"}},"created_at":"2026-05-18T00:36:18.942183+00:00","updated_at":"2026-05-18T00:36:18.942183+00:00"}