{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EY7UI2CBPUDYYL5KCPX4BCCKYU","short_pith_number":"pith:EY7UI2CB","schema_version":"1.0","canonical_sha256":"263f4468417d078c2faa13efc0884ac53bb787e7c066426805dab6aa74edbcb0","source":{"kind":"arxiv","id":"1806.00729","version":1},"attestation_state":"computed","paper":{"title":"Partitioning transitive tournaments into isomorphic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Attila Sali, G\\'abor Simonyi, G\\'abor Tardos","submitted_at":"2018-06-03T02:28:35Z","abstract_excerpt":"In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We investigate the possibilities of generalizing this theorem to decompositions of the complete graph into three or more isomorphic graphs. We find that a complete characterization of when an orientation with similar properties is possible seems elusive. Nevertheless, we give sufficient conditions that generalize the earlier theorem and also imply that decompositi"},"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":"1806.00729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-03T02:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"f63ab9d1258d14ffa15bd020ece03be217d2980a1f67190866444a6c4156b51d","abstract_canon_sha256":"4ddbcdbdfd6a4a2ebbccb205bc6039871ffcb0c80c00069705f1bb34b740da0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.636244Z","signature_b64":"TLj4bY/JFGHuuFXS8enJnGKyqEfoDqU3waJWvX45qwvkeOujYLBWCp7Hoz8ZGVXs3Su8aLNOQEoK1u8Upfe4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263f4468417d078c2faa13efc0884ac53bb787e7c066426805dab6aa74edbcb0","last_reissued_at":"2026-05-18T00:14:18.635711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.635711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning transitive tournaments into isomorphic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Attila Sali, G\\'abor Simonyi, G\\'abor Tardos","submitted_at":"2018-06-03T02:28:35Z","abstract_excerpt":"In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We investigate the possibilities of generalizing this theorem to decompositions of the complete graph into three or more isomorphic graphs. We find that a complete characterization of when an orientation with similar properties is possible seems elusive. Nevertheless, we give sufficient conditions that generalize the earlier theorem and also imply that decompositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00729","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":"1806.00729","created_at":"2026-05-18T00:14:18.635783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00729v1","created_at":"2026-05-18T00:14:18.635783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00729","created_at":"2026-05-18T00:14:18.635783+00:00"},{"alias_kind":"pith_short_12","alias_value":"EY7UI2CBPUDY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EY7UI2CBPUDYYL5K","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EY7UI2CB","created_at":"2026-05-18T12:32:22.470017+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/EY7UI2CBPUDYYL5KCPX4BCCKYU","json":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU.json","graph_json":"https://pith.science/api/pith-number/EY7UI2CBPUDYYL5KCPX4BCCKYU/graph.json","events_json":"https://pith.science/api/pith-number/EY7UI2CBPUDYYL5KCPX4BCCKYU/events.json","paper":"https://pith.science/paper/EY7UI2CB"},"agent_actions":{"view_html":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU","download_json":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU.json","view_paper":"https://pith.science/paper/EY7UI2CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00729&json=true","fetch_graph":"https://pith.science/api/pith-number/EY7UI2CBPUDYYL5KCPX4BCCKYU/graph.json","fetch_events":"https://pith.science/api/pith-number/EY7UI2CBPUDYYL5KCPX4BCCKYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU/action/storage_attestation","attest_author":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU/action/author_attestation","sign_citation":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU/action/citation_signature","submit_replication":"https://pith.science/pith/EY7UI2CBPUDYYL5KCPX4BCCKYU/action/replication_record"}},"created_at":"2026-05-18T00:14:18.635783+00:00","updated_at":"2026-05-18T00:14:18.635783+00:00"}