{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2SLOIVJGEMUXM6AF3I4FLU4RPZ","short_pith_number":"pith:2SLOIVJG","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"},"canonical_sha256":"d496e455262329767805da3855d3917e500e26d90390f83c09aa01e517cabd67","source":{"kind":"arxiv","id":"1706.02930","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02930","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02930v2","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02930","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"2SLOIVJGEMUX","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SLOIVJGEMUXM6AF","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SLOIVJG","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2SLOIVJGEMUXM6AF3I4FLU4RPZ","target":"record","payload":{"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"},"canonical_sha256":"d496e455262329767805da3855d3917e500e26d90390f83c09aa01e517cabd67","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"},"source_kind":"arxiv","source_id":"1706.02930","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXMLt8WS5ZsJykqcMN+sEIlZZlJUhEkQHqGlxiJ/GXM3g/zX635kMkTwMOaFUz8/lqGHMsZuCPlnvfjLAMNcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:22:49.309475Z"},"content_sha256":"89783b6ec1a9736e72242f9f0d6888fb76b22dbe80afb57220b6c734a0b83a41","schema_version":"1.0","event_id":"sha256:89783b6ec1a9736e72242f9f0d6888fb76b22dbe80afb57220b6c734a0b83a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2SLOIVJGEMUXM6AF3I4FLU4RPZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Avui6TWZC/2ceEsgGNua4JhIGa2saVNaK7JzBpbCUQSOZfKDjbNfRmDBrsYtGzohaTxFwcZr7HabmCLj+uPIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:22:49.309849Z"},"content_sha256":"10a49042bb2f4d708b5351995db3f2e50deea233ea9b5c9daf09825ee431ec5c","schema_version":"1.0","event_id":"sha256:10a49042bb2f4d708b5351995db3f2e50deea233ea9b5c9daf09825ee431ec5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/bundle.json","state_url":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T02:22:49Z","links":{"resolver":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ","bundle":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/bundle.json","state":"https://pith.science/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SLOIVJGEMUXM6AF3I4FLU4RPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2SLOIVJGEMUXM6AF3I4FLU4RPZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6329c69254d780956f4b20f7a9cc6942e50c9c00a7cdb918a65a034d4bbd0d67","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-09T12:45:06Z","title_canon_sha256":"44634b7413669bfe09dbf8b7f02a94134a4dcc0c4c8ced547e78a76f7823ffa5"},"schema_version":"1.0","source":{"id":"1706.02930","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02930","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02930v2","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02930","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"2SLOIVJGEMUX","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SLOIVJGEMUXM6AF","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SLOIVJG","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:10a49042bb2f4d708b5351995db3f2e50deea233ea9b5c9daf09825ee431ec5c","target":"graph","created_at":"2026-05-17T23:44:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Peter J. Cameron, R. A. Bailey, Tomas Nilson","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-09T12:45:06Z","title":"Sesqui-arrays, a generalisation of triple arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02930","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:89783b6ec1a9736e72242f9f0d6888fb76b22dbe80afb57220b6c734a0b83a41","target":"record","created_at":"2026-05-17T23:44:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6329c69254d780956f4b20f7a9cc6942e50c9c00a7cdb918a65a034d4bbd0d67","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-09T12:45:06Z","title_canon_sha256":"44634b7413669bfe09dbf8b7f02a94134a4dcc0c4c8ced547e78a76f7823ffa5"},"schema_version":"1.0","source":{"id":"1706.02930","kind":"arxiv","version":2}},"canonical_sha256":"d496e455262329767805da3855d3917e500e26d90390f83c09aa01e517cabd67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d496e455262329767805da3855d3917e500e26d90390f83c09aa01e517cabd67","first_computed_at":"2026-05-17T23:44:43.573919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:43.573919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qQdBrnDi0fVwkMnSTmkWxrJptdfUYBjrXu++9LaoCw5ncwX7m7cec5qgWObK6X3m5bkmZvn53pHupPsRrt2XCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:43.574407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02930","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89783b6ec1a9736e72242f9f0d6888fb76b22dbe80afb57220b6c734a0b83a41","sha256:10a49042bb2f4d708b5351995db3f2e50deea233ea9b5c9daf09825ee431ec5c"],"state_sha256":"ca5ccb8047e2f4bef49b360bcea42f1b134a3b4c7b2340e45d02edbbcb23d5d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJ4fpXt1dk5NcESZgpvNfa7Bm2nT+IsY4nPZd2Ceee8kpZ3AFcw2TiVBJJYQmQ2W9ce0ABlLsskbTQtUe7OQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:22:49.313083Z","bundle_sha256":"fb2493984c6d73c76c141169dab4ca5eda3b668094dd6da2d63aaac1032ebdf4"}}