{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:7VZYZQXVC4FH5S4W3EW2QO7CT2","short_pith_number":"pith:7VZYZQXV","schema_version":"1.0","canonical_sha256":"fd738cc2f5170a7ecb96d92da83be29e9428b2976b9e0bfafb7794a04f7f74db","source":{"kind":"arxiv","id":"cs/0604041","version":2},"attestation_state":"computed","paper":{"title":"On Orthogonality of Latin Squares","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Moon Ho Lee, R.N.Mohan, Subash Pokreal","submitted_at":"2006-04-11T02:54:04Z","abstract_excerpt":"An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in the resultant array if each ordered pair occurs once and only once then they are called othogonal Latin Squares. A frequency square is an nxn matrix, such that each element from the list of n elements, occurs t times in each row and in each column. These two concepts lead to a new third concept called as t orthogonal latin squares, where from a set of m ortho"},"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":"cs/0604041","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2006-04-11T02:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"6c53eef22c4e1600dab02ae2d8f87b5bb1da3c5b4e18a63aaa1cf479e6d2bc61","abstract_canon_sha256":"c9c9f70da17337a4210ec2eef35d96daeb90da7836ec3feb273d03956c124886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:54.082677Z","signature_b64":"XoPyNa+/elKIydF6OUyeHsoqkE3LObr6ZBE2XxmyqnBY6kJpQh3Sw/f+jzFVIbdOyBCoxgKW3mmVRiWv6NbRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd738cc2f5170a7ecb96d92da83be29e9428b2976b9e0bfafb7794a04f7f74db","last_reissued_at":"2026-05-18T04:08:54.082239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:54.082239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Orthogonality of Latin Squares","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Moon Ho Lee, R.N.Mohan, Subash Pokreal","submitted_at":"2006-04-11T02:54:04Z","abstract_excerpt":"An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in the resultant array if each ordered pair occurs once and only once then they are called othogonal Latin Squares. A frequency square is an nxn matrix, such that each element from the list of n elements, occurs t times in each row and in each column. These two concepts lead to a new third concept called as t orthogonal latin squares, where from a set of m ortho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604041","kind":"arxiv","version":2},"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":"cs/0604041","created_at":"2026-05-18T04:08:54.082303+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0604041v2","created_at":"2026-05-18T04:08:54.082303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604041","created_at":"2026-05-18T04:08:54.082303+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VZYZQXVC4FH","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VZYZQXVC4FH5S4W","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VZYZQXV","created_at":"2026-05-18T12:25:53.939244+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/7VZYZQXVC4FH5S4W3EW2QO7CT2","json":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2.json","graph_json":"https://pith.science/api/pith-number/7VZYZQXVC4FH5S4W3EW2QO7CT2/graph.json","events_json":"https://pith.science/api/pith-number/7VZYZQXVC4FH5S4W3EW2QO7CT2/events.json","paper":"https://pith.science/paper/7VZYZQXV"},"agent_actions":{"view_html":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2","download_json":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2.json","view_paper":"https://pith.science/paper/7VZYZQXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0604041&json=true","fetch_graph":"https://pith.science/api/pith-number/7VZYZQXVC4FH5S4W3EW2QO7CT2/graph.json","fetch_events":"https://pith.science/api/pith-number/7VZYZQXVC4FH5S4W3EW2QO7CT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2/action/storage_attestation","attest_author":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2/action/author_attestation","sign_citation":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2/action/citation_signature","submit_replication":"https://pith.science/pith/7VZYZQXVC4FH5S4W3EW2QO7CT2/action/replication_record"}},"created_at":"2026-05-18T04:08:54.082303+00:00","updated_at":"2026-05-18T04:08:54.082303+00:00"}