{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U7NA4UQR42TCD6DFAZJITUUFXB","short_pith_number":"pith:U7NA4UQR","schema_version":"1.0","canonical_sha256":"a7da0e5211e6a621f865065289d285b84841e50ba9100d8be9d7082e793eefc4","source":{"kind":"arxiv","id":"1808.05213","version":1},"attestation_state":"computed","paper":{"title":"Quasi-transversal in Latin Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Behnaz Pahlavsay","submitted_at":"2018-08-15T08:01:16Z","abstract_excerpt":"In this paper, we first present the relation between a transversal in a Latin square with some concepts in its Latin square graph, and give an equivalent condition for a Latin square has an orthogonal mate. The most famous open problem involving Combinatorics is to find maximum number of disjoint transversals in a Latin square. So finding some family of decomposable Latin squares into disjoint transversals is our next aim. In the next section, we give an equivalent statement of a conjecture which has been attributed to Brualdi, Stein and Ryser by the concept of quasi-transversal. Finally, we p"},"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":"1808.05213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-15T08:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"a4add71bf8f1f731e19ca816baacfced1e55304a83335710a6cfe9162cafe1dd","abstract_canon_sha256":"27d8f901281b641932901b676108c908f1373e5df43b1b386779e55d7122dca3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.835926Z","signature_b64":"4quyQ8kkpAxU6EDBbf3gCasH9P1iWrvCfh4QF1Uszzd308dKuHNz85c9FbU9M0lnneT8bfOChCW5zx4MQVG5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7da0e5211e6a621f865065289d285b84841e50ba9100d8be9d7082e793eefc4","last_reissued_at":"2026-05-18T00:07:57.835307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.835307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-transversal in Latin Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Behnaz Pahlavsay","submitted_at":"2018-08-15T08:01:16Z","abstract_excerpt":"In this paper, we first present the relation between a transversal in a Latin square with some concepts in its Latin square graph, and give an equivalent condition for a Latin square has an orthogonal mate. The most famous open problem involving Combinatorics is to find maximum number of disjoint transversals in a Latin square. So finding some family of decomposable Latin squares into disjoint transversals is our next aim. In the next section, we give an equivalent statement of a conjecture which has been attributed to Brualdi, Stein and Ryser by the concept of quasi-transversal. Finally, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05213","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":"1808.05213","created_at":"2026-05-18T00:07:57.835416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05213v1","created_at":"2026-05-18T00:07:57.835416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05213","created_at":"2026-05-18T00:07:57.835416+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7NA4UQR42TC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7NA4UQR42TCD6DF","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7NA4UQR","created_at":"2026-05-18T12:32:56.356000+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/U7NA4UQR42TCD6DFAZJITUUFXB","json":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB.json","graph_json":"https://pith.science/api/pith-number/U7NA4UQR42TCD6DFAZJITUUFXB/graph.json","events_json":"https://pith.science/api/pith-number/U7NA4UQR42TCD6DFAZJITUUFXB/events.json","paper":"https://pith.science/paper/U7NA4UQR"},"agent_actions":{"view_html":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB","download_json":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB.json","view_paper":"https://pith.science/paper/U7NA4UQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05213&json=true","fetch_graph":"https://pith.science/api/pith-number/U7NA4UQR42TCD6DFAZJITUUFXB/graph.json","fetch_events":"https://pith.science/api/pith-number/U7NA4UQR42TCD6DFAZJITUUFXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB/action/storage_attestation","attest_author":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB/action/author_attestation","sign_citation":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB/action/citation_signature","submit_replication":"https://pith.science/pith/U7NA4UQR42TCD6DFAZJITUUFXB/action/replication_record"}},"created_at":"2026-05-18T00:07:57.835416+00:00","updated_at":"2026-05-18T00:07:57.835416+00:00"}