{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NTQ4MFL5GVTWZU66ZVZSTGZ2UD","short_pith_number":"pith:NTQ4MFL5","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"},"canonical_sha256":"6ce1c6157d35676cd3decd73299b3aa0d3833020b24910ba0688f27a7357fd2b","source":{"kind":"arxiv","id":"1509.00488","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00488","created_at":"2026-05-18T01:14:25Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00488v2","created_at":"2026-05-18T01:14:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00488","created_at":"2026-05-18T01:14:25Z"},{"alias_kind":"pith_short_12","alias_value":"NTQ4MFL5GVTW","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTQ4MFL5GVTWZU66","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTQ4MFL5","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NTQ4MFL5GVTWZU66ZVZSTGZ2UD","target":"record","payload":{"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"},"canonical_sha256":"6ce1c6157d35676cd3decd73299b3aa0d3833020b24910ba0688f27a7357fd2b","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"},"source_kind":"arxiv","source_id":"1509.00488","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYtng5/6RqUn+sltoUQNfEGS0IM0p6wHBbS9ZpBWo2avHaQ9geJBOBondqXGZcv+uGXJiTw3dkteOU+4/DAqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:02:24.902763Z"},"content_sha256":"c88374ea932b6167517f5031552263a73290b6ac25836adceb04ec17303e8ee6","schema_version":"1.0","event_id":"sha256:c88374ea932b6167517f5031552263a73290b6ac25836adceb04ec17303e8ee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NTQ4MFL5GVTWZU66ZVZSTGZ2UD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZc5qIh0nQ5n7JKyr/eGFDYQ8hbc5gI8kTo63+Ffbe2i+hTEnK9x0P13Otk5kiMgnviWKd1HaQIUOig3lm2/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:02:24.903435Z"},"content_sha256":"e2b7ad35eb443e7de83eacb477f23bd933470a794228ea1018ae8bb9737d2034","schema_version":"1.0","event_id":"sha256:e2b7ad35eb443e7de83eacb477f23bd933470a794228ea1018ae8bb9737d2034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/bundle.json","state_url":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T11:02:24Z","links":{"resolver":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD","bundle":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/bundle.json","state":"https://pith.science/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTQ4MFL5GVTWZU66ZVZSTGZ2UD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NTQ4MFL5GVTWZU66ZVZSTGZ2UD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2116c56c0afb0679d893f6eefba3e9220b520cd4054b418ec28749d9d9fe2fa0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T20:18:01Z","title_canon_sha256":"771f4664d720399817690f99b9a60145ed6617e2aee4d4da2dd02919ff861f62"},"schema_version":"1.0","source":{"id":"1509.00488","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00488","created_at":"2026-05-18T01:14:25Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00488v2","created_at":"2026-05-18T01:14:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00488","created_at":"2026-05-18T01:14:25Z"},{"alias_kind":"pith_short_12","alias_value":"NTQ4MFL5GVTW","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTQ4MFL5GVTWZU66","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTQ4MFL5","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:e2b7ad35eb443e7de83eacb477f23bd933470a794228ea1018ae8bb9737d2034","target":"graph","created_at":"2026-05-18T01:14:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Uwe Schauz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T20:18:01Z","title":"The Tournament Scheduling Problem with Absences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00488","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c88374ea932b6167517f5031552263a73290b6ac25836adceb04ec17303e8ee6","target":"record","created_at":"2026-05-18T01:14:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2116c56c0afb0679d893f6eefba3e9220b520cd4054b418ec28749d9d9fe2fa0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T20:18:01Z","title_canon_sha256":"771f4664d720399817690f99b9a60145ed6617e2aee4d4da2dd02919ff861f62"},"schema_version":"1.0","source":{"id":"1509.00488","kind":"arxiv","version":2}},"canonical_sha256":"6ce1c6157d35676cd3decd73299b3aa0d3833020b24910ba0688f27a7357fd2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ce1c6157d35676cd3decd73299b3aa0d3833020b24910ba0688f27a7357fd2b","first_computed_at":"2026-05-18T01:14:25.903881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:25.903881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MC6dYsNO44Gek1NS31hYqCpJCKBcUkn7phWfL6IMsb3ihpxRKfPpJ2Xj71bV24sTI+Wc/sNYNvTtDvkL9iPgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:25.904574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00488","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c88374ea932b6167517f5031552263a73290b6ac25836adceb04ec17303e8ee6","sha256:e2b7ad35eb443e7de83eacb477f23bd933470a794228ea1018ae8bb9737d2034"],"state_sha256":"b953afb18d6324c011767201a89b21c05a4ce8095de6a188ec2f484f1ed48b96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TogI+rHgsBLzOI9xxdK3lT9RtZfh8emjQu0BSfKC7zz3eUQ+eV53qFASl0vWsQ7SEr3DZyxA//Fe+hcfZrxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:02:24.906488Z","bundle_sha256":"617a6d3f329c86eb5a1cfe1f79960192a052d5e545aafa77af5ca93f6c50ceda"}}