{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4ACFTSAMQ2CQJC2OF6GOJHBDVH","short_pith_number":"pith:4ACFTSAM","schema_version":"1.0","canonical_sha256":"e00459c80c8685048b4e2f8ce49c23a9e0b24d527ba4ed8ef1911769756fea28","source":{"kind":"arxiv","id":"1110.0620","version":1},"attestation_state":"computed","paper":{"title":"A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ryuhei Miyashiro, Shinji Imahori, Tomomi Matsui","submitted_at":"2011-10-04T09:35:21Z","abstract_excerpt":"A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the no-repeater and mirrored constraints. Computational experiments show that the algorithm generates solutions of good quality."},"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":"1110.0620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-04T09:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"9d3d4d694693f6ee3772c9f63076b2a0782afdd6e6a6b22e7f4479e408cba44c","abstract_canon_sha256":"fcbad454d5b97ec0d7d1ffa4da90c656d928f07b6defb2916ebd7448f3f0ee98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:54.529971Z","signature_b64":"9maMEPS7gDUwH2oL3etYoSUI6y5Oh9DhZBz07cAn2KzTXSMRns2CAVQIbECKEZtEN3DjizPP9vg619O5895/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e00459c80c8685048b4e2f8ce49c23a9e0b24d527ba4ed8ef1911769756fea28","last_reissued_at":"2026-05-18T01:22:54.529398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:54.529398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ryuhei Miyashiro, Shinji Imahori, Tomomi Matsui","submitted_at":"2011-10-04T09:35:21Z","abstract_excerpt":"A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the no-repeater and mirrored constraints. Computational experiments show that the algorithm generates solutions of good quality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0620","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":"1110.0620","created_at":"2026-05-18T01:22:54.529493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0620v1","created_at":"2026-05-18T01:22:54.529493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0620","created_at":"2026-05-18T01:22:54.529493+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ACFTSAMQ2CQ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ACFTSAMQ2CQJC2O","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ACFTSAM","created_at":"2026-05-18T12:26:20.644004+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/4ACFTSAMQ2CQJC2OF6GOJHBDVH","json":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH.json","graph_json":"https://pith.science/api/pith-number/4ACFTSAMQ2CQJC2OF6GOJHBDVH/graph.json","events_json":"https://pith.science/api/pith-number/4ACFTSAMQ2CQJC2OF6GOJHBDVH/events.json","paper":"https://pith.science/paper/4ACFTSAM"},"agent_actions":{"view_html":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH","download_json":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH.json","view_paper":"https://pith.science/paper/4ACFTSAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0620&json=true","fetch_graph":"https://pith.science/api/pith-number/4ACFTSAMQ2CQJC2OF6GOJHBDVH/graph.json","fetch_events":"https://pith.science/api/pith-number/4ACFTSAMQ2CQJC2OF6GOJHBDVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH/action/storage_attestation","attest_author":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH/action/author_attestation","sign_citation":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH/action/citation_signature","submit_replication":"https://pith.science/pith/4ACFTSAMQ2CQJC2OF6GOJHBDVH/action/replication_record"}},"created_at":"2026-05-18T01:22:54.529493+00:00","updated_at":"2026-05-18T01:22:54.529493+00:00"}