{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NTQ4MFL5GVTWZU66ZVZSTGZ2UD","short_pith_number":"pith:NTQ4MFL5","schema_version":"1.0","canonical_sha256":"6ce1c6157d35676cd3decd73299b3aa0d3833020b24910ba0688f27a7357fd2b","source":{"kind":"arxiv","id":"1509.00488","version":2},"attestation_state":"computed","paper":{"title":"The Tournament Scheduling Problem with Absences","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Uwe Schauz","submitted_at":"2015-09-01T20:18:01Z","abstract_excerpt":"We study time scheduling problems with allowed absences as a new kind of graph coloring problem. One may think of a sport tournament where each player (each team) is permitted a certain number $t$ of absences. We then examine how many rounds are needed to schedule the whole tournament in the worst case. This upper limit depends on $t$ and on the structure of the graph $G$ whose edges represent the games that have to be played, but also on whether or not the absences are announced before the tournament starts. Therefore, we actually have two upper limits for the number of required rounds. We ha"},"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":"1509.00488","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T20:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"771f4664d720399817690f99b9a60145ed6617e2aee4d4da2dd02919ff861f62","abstract_canon_sha256":"2116c56c0afb0679d893f6eefba3e9220b520cd4054b418ec28749d9d9fe2fa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:25.904574Z","signature_b64":"MC6dYsNO44Gek1NS31hYqCpJCKBcUkn7phWfL6IMsb3ihpxRKfPpJ2Xj71bV24sTI+Wc/sNYNvTtDvkL9iPgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce1c6157d35676cd3decd73299b3aa0d3833020b24910ba0688f27a7357fd2b","last_reissued_at":"2026-05-18T01:14:25.903881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:25.903881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tournament Scheduling Problem with Absences","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Uwe Schauz","submitted_at":"2015-09-01T20:18:01Z","abstract_excerpt":"We study time scheduling problems with allowed absences as a new kind of graph coloring problem. One may think of a sport tournament where each player (each team) is permitted a certain number $t$ of absences. We then examine how many rounds are needed to schedule the whole tournament in the worst case. This upper limit depends on $t$ and on the structure of the graph $G$ whose edges represent the games that have to be played, but also on whether or not the absences are announced before the tournament starts. Therefore, we actually have two upper limits for the number of required rounds. We ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00488","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":"1509.00488","created_at":"2026-05-18T01:14:25.904015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00488v2","created_at":"2026-05-18T01:14:25.904015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00488","created_at":"2026-05-18T01:14:25.904015+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTQ4MFL5GVTW","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTQ4MFL5GVTWZU66","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTQ4MFL5","created_at":"2026-05-18T12:29:34.919912+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/NTQ4MFL5GVTWZU66ZVZSTGZ2UD","json":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD.json","graph_json":"https://pith.science/api/pith-number/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/graph.json","events_json":"https://pith.science/api/pith-number/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/events.json","paper":"https://pith.science/paper/NTQ4MFL5"},"agent_actions":{"view_html":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD","download_json":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD.json","view_paper":"https://pith.science/paper/NTQ4MFL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00488&json=true","fetch_graph":"https://pith.science/api/pith-number/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/graph.json","fetch_events":"https://pith.science/api/pith-number/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/action/storage_attestation","attest_author":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/action/author_attestation","sign_citation":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/action/citation_signature","submit_replication":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/action/replication_record"}},"created_at":"2026-05-18T01:14:25.904015+00:00","updated_at":"2026-05-18T01:14:25.904015+00:00"}