{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2TCC5CMSRQOHTCY4IBDVDM3LTE","short_pith_number":"pith:2TCC5CMS","schema_version":"1.0","canonical_sha256":"d4c42e89928c1c798b1c404751b36b9929d69a175edf59fc30d12deb61ebe8ee","source":{"kind":"arxiv","id":"1401.6049","version":1},"attestation_state":"computed","paper":{"title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ken-ichi Kawarabayashi, Richard Hoshino","submitted_at":"2014-01-23T16:45:07Z","abstract_excerpt":"In some domestic professional sports leagues, the home stadiums are located in cities connected by a common train line running in one direction. For these instances, we can incorporate this geographical information to determine optimal or nearly-optimal solutions to the n-team Traveling Tournament Problem (TTP), an NP-hard sports scheduling problem whose solution is a double round-robin tournament schedule that minimizes the sum total of distances traveled by all n teams.\nWe introduce the Linear Distance Traveling Tournament Problem (LD-TTP), and solve it for n=4 and n=6, generating the comple"},"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.6049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T16:45:07Z","cross_cats_sorted":[],"title_canon_sha256":"764d6b99fe502d507f28ede6a11639f8b04fdb69f9a6fdc5ff5d9843596cfc47","abstract_canon_sha256":"9576abc2701f03e65c76173019963d917610266d16d2c1cedd0bbe203dc75bc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.018665Z","signature_b64":"jZcEN4pTt2aAD4ZEc0hB1g1KwEf0paq6OB482by0pfPLMIa0ndr4WsuF1ejmHb9IpQo2JW9iCoEDqL0BIwjqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4c42e89928c1c798b1c404751b36b9929d69a175edf59fc30d12deb61ebe8ee","last_reissued_at":"2026-05-18T03:01:23.018016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.018016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ken-ichi Kawarabayashi, Richard Hoshino","submitted_at":"2014-01-23T16:45:07Z","abstract_excerpt":"In some domestic professional sports leagues, the home stadiums are located in cities connected by a common train line running in one direction. For these instances, we can incorporate this geographical information to determine optimal or nearly-optimal solutions to the n-team Traveling Tournament Problem (TTP), an NP-hard sports scheduling problem whose solution is a double round-robin tournament schedule that minimizes the sum total of distances traveled by all n teams.\nWe introduce the Linear Distance Traveling Tournament Problem (LD-TTP), and solve it for n=4 and n=6, generating the comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6049","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.6049","created_at":"2026-05-18T03:01:23.018096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6049v1","created_at":"2026-05-18T03:01:23.018096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6049","created_at":"2026-05-18T03:01:23.018096+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TCC5CMSRQOH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TCC5CMSRQOHTCY4","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TCC5CMS","created_at":"2026-05-18T12:28:11.866339+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/2TCC5CMSRQOHTCY4IBDVDM3LTE","json":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE.json","graph_json":"https://pith.science/api/pith-number/2TCC5CMSRQOHTCY4IBDVDM3LTE/graph.json","events_json":"https://pith.science/api/pith-number/2TCC5CMSRQOHTCY4IBDVDM3LTE/events.json","paper":"https://pith.science/paper/2TCC5CMS"},"agent_actions":{"view_html":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE","download_json":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE.json","view_paper":"https://pith.science/paper/2TCC5CMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6049&json=true","fetch_graph":"https://pith.science/api/pith-number/2TCC5CMSRQOHTCY4IBDVDM3LTE/graph.json","fetch_events":"https://pith.science/api/pith-number/2TCC5CMSRQOHTCY4IBDVDM3LTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE/action/storage_attestation","attest_author":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE/action/author_attestation","sign_citation":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE/action/citation_signature","submit_replication":"https://pith.science/pith/2TCC5CMSRQOHTCY4IBDVDM3LTE/action/replication_record"}},"created_at":"2026-05-18T03:01:23.018096+00:00","updated_at":"2026-05-18T03:01:23.018096+00:00"}