{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2SLOIVJGEMUXM6AF3I4FLU4RPZ","short_pith_number":"pith:2SLOIVJG","schema_version":"1.0","canonical_sha256":"d496e455262329767805da3855d3917e500e26d90390f83c09aa01e517cabd67","source":{"kind":"arxiv","id":"1706.02930","version":2},"attestation_state":"computed","paper":{"title":"Sesqui-arrays, a generalisation of triple arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, R. A. Bailey, Tomas Nilson","submitted_at":"2017-06-09T12:45:06Z","abstract_excerpt":"A triple array is a rectangular array containing letters, each letter occurring equally often with no repeats in rows or columns, such that the number of letters common to two rows, two columns, or a row and a column are (possibly different) non-zero constants. Deleting the condition on the letters common to a row and a column gives a double array. We propose the term \\emph{sesqui-array} for such an array when only the condition on pairs of columns is deleted. Thus all triple arrays are sesqui-arrays.\n  In this paper we give three constructions for sesqui-arrays. The first gives $(n+1)\\times n"},"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":"1706.02930","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-09T12:45:06Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"44634b7413669bfe09dbf8b7f02a94134a4dcc0c4c8ced547e78a76f7823ffa5","abstract_canon_sha256":"6329c69254d780956f4b20f7a9cc6942e50c9c00a7cdb918a65a034d4bbd0d67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.574407Z","signature_b64":"qQdBrnDi0fVwkMnSTmkWxrJptdfUYBjrXu++9LaoCw5ncwX7m7cec5qgWObK6X3m5bkmZvn53pHupPsRrt2XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d496e455262329767805da3855d3917e500e26d90390f83c09aa01e517cabd67","last_reissued_at":"2026-05-17T23:44:43.573919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.573919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sesqui-arrays, a generalisation of triple arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, R. A. Bailey, Tomas Nilson","submitted_at":"2017-06-09T12:45:06Z","abstract_excerpt":"A triple array is a rectangular array containing letters, each letter occurring equally often with no repeats in rows or columns, such that the number of letters common to two rows, two columns, or a row and a column are (possibly different) non-zero constants. Deleting the condition on the letters common to a row and a column gives a double array. We propose the term \\emph{sesqui-array} for such an array when only the condition on pairs of columns is deleted. Thus all triple arrays are sesqui-arrays.\n  In this paper we give three constructions for sesqui-arrays. The first gives $(n+1)\\times n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02930","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":"1706.02930","created_at":"2026-05-17T23:44:43.573984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02930v2","created_at":"2026-05-17T23:44:43.573984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02930","created_at":"2026-05-17T23:44:43.573984+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SLOIVJGEMUX","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SLOIVJGEMUXM6AF","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SLOIVJG","created_at":"2026-05-18T12:30:55.937587+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/2SLOIVJGEMUXM6AF3I4FLU4RPZ","json":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ.json","graph_json":"https://pith.science/api/pith-number/2SLOIVJGEMUXM6AF3I4FLU4RPZ/graph.json","events_json":"https://pith.science/api/pith-number/2SLOIVJGEMUXM6AF3I4FLU4RPZ/events.json","paper":"https://pith.science/paper/2SLOIVJG"},"agent_actions":{"view_html":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ","download_json":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ.json","view_paper":"https://pith.science/paper/2SLOIVJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02930&json=true","fetch_graph":"https://pith.science/api/pith-number/2SLOIVJGEMUXM6AF3I4FLU4RPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2SLOIVJGEMUXM6AF3I4FLU4RPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/action/storage_attestation","attest_author":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/action/author_attestation","sign_citation":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/action/citation_signature","submit_replication":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/action/replication_record"}},"created_at":"2026-05-17T23:44:43.573984+00:00","updated_at":"2026-05-17T23:44:43.573984+00:00"}