{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TFUBA4ACUQ6RKAK62Y3J5U2FGO","short_pith_number":"pith:TFUBA4AC","schema_version":"1.0","canonical_sha256":"9968107002a43d15015ed6369ed34533afc0197d013cde77387364d12d755991","source":{"kind":"arxiv","id":"1801.00591","version":1},"attestation_state":"computed","paper":{"title":"Unions of Orthogonal Arrays and their aberrations via Hilbert bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Fabio Rapallo, Roberto Fontana","submitted_at":"2018-01-02T09:59:27Z","abstract_excerpt":"We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a collection of OAs which belong to an inclusion-minimal set of OAs. We derive a formula for computing the (Generalized) Word Length Pattern of a union of OAs that makes use of their polynomial counting functions. In this way the best OAs according to the Generalized Minimum Aberration criterion can be found by simply exploring a relatively small set of counting functions. The classes of OAs with 5 binary factors, strength 2, and sizes 16 and 20 are fully described."},"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":"1801.00591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-02T09:59:27Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"28e0a45ae1277278d43856722f3a42c4d583299592306faa711fb1d80b56975a","abstract_canon_sha256":"3794ab6831cfcd2208c1bb763e4af0563ee4c011a4a0d88e7d20563aba00c847"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:52.938345Z","signature_b64":"Ak3vy4lgsAtgmI4Iw5227bx7P9nYXJKLyzYAr3BdhUWG6qsnYyNJPC0wwF/6BgXfIYIDEUScFQxO5P2N5jF5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9968107002a43d15015ed6369ed34533afc0197d013cde77387364d12d755991","last_reissued_at":"2026-05-18T00:26:52.937676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:52.937676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unions of Orthogonal Arrays and their aberrations via Hilbert bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Fabio Rapallo, Roberto Fontana","submitted_at":"2018-01-02T09:59:27Z","abstract_excerpt":"We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a collection of OAs which belong to an inclusion-minimal set of OAs. We derive a formula for computing the (Generalized) Word Length Pattern of a union of OAs that makes use of their polynomial counting functions. In this way the best OAs according to the Generalized Minimum Aberration criterion can be found by simply exploring a relatively small set of counting functions. The classes of OAs with 5 binary factors, strength 2, and sizes 16 and 20 are fully described."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00591","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":"1801.00591","created_at":"2026-05-18T00:26:52.937748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00591v1","created_at":"2026-05-18T00:26:52.937748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00591","created_at":"2026-05-18T00:26:52.937748+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFUBA4ACUQ6R","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFUBA4ACUQ6RKAK6","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFUBA4AC","created_at":"2026-05-18T12:32:53.628368+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/TFUBA4ACUQ6RKAK62Y3J5U2FGO","json":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO.json","graph_json":"https://pith.science/api/pith-number/TFUBA4ACUQ6RKAK62Y3J5U2FGO/graph.json","events_json":"https://pith.science/api/pith-number/TFUBA4ACUQ6RKAK62Y3J5U2FGO/events.json","paper":"https://pith.science/paper/TFUBA4AC"},"agent_actions":{"view_html":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO","download_json":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO.json","view_paper":"https://pith.science/paper/TFUBA4AC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00591&json=true","fetch_graph":"https://pith.science/api/pith-number/TFUBA4ACUQ6RKAK62Y3J5U2FGO/graph.json","fetch_events":"https://pith.science/api/pith-number/TFUBA4ACUQ6RKAK62Y3J5U2FGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO/action/storage_attestation","attest_author":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO/action/author_attestation","sign_citation":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO/action/citation_signature","submit_replication":"https://pith.science/pith/TFUBA4ACUQ6RKAK62Y3J5U2FGO/action/replication_record"}},"created_at":"2026-05-18T00:26:52.937748+00:00","updated_at":"2026-05-18T00:26:52.937748+00:00"}