{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DVFKFRH7P7QZPC5NRQBWLOEIEC","short_pith_number":"pith:DVFKFRH7","schema_version":"1.0","canonical_sha256":"1d4aa2c4ff7fe1978bad8c0365b888208206697f5d9b3b6d47a15b56905abee3","source":{"kind":"arxiv","id":"1401.3909","version":1},"attestation_state":"computed","paper":{"title":"Scheduling Bipartite Tournaments to Minimize Total Travel Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Ken-ichi Kawarabayashi, Richard Hoshino","submitted_at":"2014-01-16T05:24:01Z","abstract_excerpt":"In many professional sports leagues, teams from opposing leagues/conferences compete against one another, playing inter-league games.  This is an example of a bipartite tournament.  In this paper, we consider the problem of reducing the total travel distance of bipartite tournaments, by analyzing inter-league scheduling from the perspective of discrete optimization.  This research has natural applications to sports scheduling, especially for leagues such as the National Basketball Association (NBA) where teams must travel long distances across North America to play all their games, thus consum"},"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":"1401.3909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:24:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0a4bfb67bb429fc14564836cda40506268981993067924cf94ce4a5f2fb4f382","abstract_canon_sha256":"f445c838ed48e5c53841e924884708552a9160d52bf46fb6cb226b2688b36c42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.065674Z","signature_b64":"PIF2pWfDHH6u5x7R3uTkO2jHx7THy8PlqQxHqA4YhHrfY8QoZehQreXA+OzJ4PRbYzWTy62GLRWMSLBnTAySAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d4aa2c4ff7fe1978bad8c0365b888208206697f5d9b3b6d47a15b56905abee3","last_reissued_at":"2026-05-18T03:02:06.064879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.064879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Bipartite Tournaments to Minimize Total Travel Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Ken-ichi Kawarabayashi, Richard Hoshino","submitted_at":"2014-01-16T05:24:01Z","abstract_excerpt":"In many professional sports leagues, teams from opposing leagues/conferences compete against one another, playing inter-league games.  This is an example of a bipartite tournament.  In this paper, we consider the problem of reducing the total travel distance of bipartite tournaments, by analyzing inter-league scheduling from the perspective of discrete optimization.  This research has natural applications to sports scheduling, especially for leagues such as the National Basketball Association (NBA) where teams must travel long distances across North America to play all their games, thus consum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3909","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":"1401.3909","created_at":"2026-05-18T03:02:06.065011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3909v1","created_at":"2026-05-18T03:02:06.065011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3909","created_at":"2026-05-18T03:02:06.065011+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVFKFRH7P7QZ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVFKFRH7P7QZPC5N","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVFKFRH7","created_at":"2026-05-18T12:28:25.294606+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/DVFKFRH7P7QZPC5NRQBWLOEIEC","json":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC.json","graph_json":"https://pith.science/api/pith-number/DVFKFRH7P7QZPC5NRQBWLOEIEC/graph.json","events_json":"https://pith.science/api/pith-number/DVFKFRH7P7QZPC5NRQBWLOEIEC/events.json","paper":"https://pith.science/paper/DVFKFRH7"},"agent_actions":{"view_html":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC","download_json":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC.json","view_paper":"https://pith.science/paper/DVFKFRH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3909&json=true","fetch_graph":"https://pith.science/api/pith-number/DVFKFRH7P7QZPC5NRQBWLOEIEC/graph.json","fetch_events":"https://pith.science/api/pith-number/DVFKFRH7P7QZPC5NRQBWLOEIEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC/action/storage_attestation","attest_author":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC/action/author_attestation","sign_citation":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC/action/citation_signature","submit_replication":"https://pith.science/pith/DVFKFRH7P7QZPC5NRQBWLOEIEC/action/replication_record"}},"created_at":"2026-05-18T03:02:06.065011+00:00","updated_at":"2026-05-18T03:02:06.065011+00:00"}