{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2KLBY7DL74KM6D2XNU57FONOLL","short_pith_number":"pith:2KLBY7DL","schema_version":"1.0","canonical_sha256":"d2961c7c6bff14cf0f576d3bf2b9ae5afc65231149721c1133093824cfd92577","source":{"kind":"arxiv","id":"1802.01217","version":1},"attestation_state":"computed","paper":{"title":"Balanced diagonals in frequency squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti, Nicholas Cavenagh","submitted_at":"2018-02-04T23:32:26Z","abstract_excerpt":"We say that a diagonal in an array is {\\em $\\lambda$-balanced} if each entry occurs $\\lambda$ times. Let $L$ be a frequency square of type $F(n;\\lambda^m)$; that is, an $n\\times n$ array in which each entry from $\\{1,2,\\dots ,m\\}$ occurs $\\lambda$ times per row and $\\lambda$ times per column. We show that if $m\\leq 3$, $L$ contains a $\\lambda$-balanced diagonal, with only one exception up to equivalence when $m=2$. We give partial results for $m\\geq 4$ and suggest a generalization of Ryser's conjecture, that every latin square of odd order has a transversal. Our method relies on first identify"},"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":"1802.01217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-04T23:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"e5899b9371f6cbd9537e5001cd6fc4a0ec71d88648a0f044b119aa4c6a731148","abstract_canon_sha256":"d4c8bceb1274ea300188cb9970a43afa6a6f5dc0e1bec06aa1e82fe7945a347c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.032434Z","signature_b64":"4mo/gf4tCK4+o2u9lhYYh/sUTej0v8htc9vcMBUTlEWDnXrhYg5JktcGMzm5gCD163iFbv5UV8ICYJi5k3eRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2961c7c6bff14cf0f576d3bf2b9ae5afc65231149721c1133093824cfd92577","last_reissued_at":"2026-05-18T00:24:27.031995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.031995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced diagonals in frequency squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti, Nicholas Cavenagh","submitted_at":"2018-02-04T23:32:26Z","abstract_excerpt":"We say that a diagonal in an array is {\\em $\\lambda$-balanced} if each entry occurs $\\lambda$ times. Let $L$ be a frequency square of type $F(n;\\lambda^m)$; that is, an $n\\times n$ array in which each entry from $\\{1,2,\\dots ,m\\}$ occurs $\\lambda$ times per row and $\\lambda$ times per column. We show that if $m\\leq 3$, $L$ contains a $\\lambda$-balanced diagonal, with only one exception up to equivalence when $m=2$. We give partial results for $m\\geq 4$ and suggest a generalization of Ryser's conjecture, that every latin square of odd order has a transversal. Our method relies on first identify"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01217","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":"1802.01217","created_at":"2026-05-18T00:24:27.032064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01217v1","created_at":"2026-05-18T00:24:27.032064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01217","created_at":"2026-05-18T00:24:27.032064+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KLBY7DL74KM","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KLBY7DL74KM6D2X","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KLBY7DL","created_at":"2026-05-18T12:32:02.567920+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/2KLBY7DL74KM6D2XNU57FONOLL","json":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL.json","graph_json":"https://pith.science/api/pith-number/2KLBY7DL74KM6D2XNU57FONOLL/graph.json","events_json":"https://pith.science/api/pith-number/2KLBY7DL74KM6D2XNU57FONOLL/events.json","paper":"https://pith.science/paper/2KLBY7DL"},"agent_actions":{"view_html":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL","download_json":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL.json","view_paper":"https://pith.science/paper/2KLBY7DL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01217&json=true","fetch_graph":"https://pith.science/api/pith-number/2KLBY7DL74KM6D2XNU57FONOLL/graph.json","fetch_events":"https://pith.science/api/pith-number/2KLBY7DL74KM6D2XNU57FONOLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL/action/storage_attestation","attest_author":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL/action/author_attestation","sign_citation":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL/action/citation_signature","submit_replication":"https://pith.science/pith/2KLBY7DL74KM6D2XNU57FONOLL/action/replication_record"}},"created_at":"2026-05-18T00:24:27.032064+00:00","updated_at":"2026-05-18T00:24:27.032064+00:00"}