{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5ITRBHDSK3QVNZ7YDKVA3JOVCI","short_pith_number":"pith:5ITRBHDS","schema_version":"1.0","canonical_sha256":"ea27109c7256e156e7f81aaa0da5d5122d90af2b5daa441eeb831401db606065","source":{"kind":"arxiv","id":"1210.8223","version":1},"attestation_state":"computed","paper":{"title":"On the Existence of Retransmission Permutation Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ian M. Wanless, Xiande Zhang","submitted_at":"2012-10-31T03:39:50Z","abstract_excerpt":"We investigate retransmission permutation arrays (RPAs) that are motivated by applications in overlapping channel transmissions. An RPA is an $n\\times n$ array in which each row is a permutation of ${1, ..., n}$, and for $1\\leq i\\leq n$, all $n$ symbols occur in each $i\\times\\lceil\\frac{n}{i}\\rceil$ rectangle in specified corners of the array. The array has types 1, 2, 3 and 4 if the stated property holds in the top left, top right, bottom left and bottom right corners, respectively. It is called latin if it is a latin square. We show that for all positive integers $n$, there exists a type-$1,"},"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":"1210.8223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-31T03:39:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6f3b986c3fa75a0d8eb468d123e9aa70bb9d92b4c01d305f77f1b2c57f3f1fde","abstract_canon_sha256":"ab26ff20fa88054d3b9484d50903933cbf5c28b864064e229ee1faf68d2748f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:12.670626Z","signature_b64":"6gUbECVF0whi1t0blkRVY/UaJDiMWbUerzRrGPqD9kveIFpKTxBtZD3NkqE/EYamL9LKhK1525LgKhV/ZJhVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea27109c7256e156e7f81aaa0da5d5122d90af2b5daa441eeb831401db606065","last_reissued_at":"2026-05-18T02:17:12.669847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:12.669847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of Retransmission Permutation Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ian M. Wanless, Xiande Zhang","submitted_at":"2012-10-31T03:39:50Z","abstract_excerpt":"We investigate retransmission permutation arrays (RPAs) that are motivated by applications in overlapping channel transmissions. An RPA is an $n\\times n$ array in which each row is a permutation of ${1, ..., n}$, and for $1\\leq i\\leq n$, all $n$ symbols occur in each $i\\times\\lceil\\frac{n}{i}\\rceil$ rectangle in specified corners of the array. The array has types 1, 2, 3 and 4 if the stated property holds in the top left, top right, bottom left and bottom right corners, respectively. It is called latin if it is a latin square. We show that for all positive integers $n$, there exists a type-$1,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8223","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":"1210.8223","created_at":"2026-05-18T02:17:12.669981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8223v1","created_at":"2026-05-18T02:17:12.669981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8223","created_at":"2026-05-18T02:17:12.669981+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ITRBHDSK3QV","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ITRBHDSK3QVNZ7Y","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ITRBHDS","created_at":"2026-05-18T12:26:53.410803+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/5ITRBHDSK3QVNZ7YDKVA3JOVCI","json":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI.json","graph_json":"https://pith.science/api/pith-number/5ITRBHDSK3QVNZ7YDKVA3JOVCI/graph.json","events_json":"https://pith.science/api/pith-number/5ITRBHDSK3QVNZ7YDKVA3JOVCI/events.json","paper":"https://pith.science/paper/5ITRBHDS"},"agent_actions":{"view_html":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI","download_json":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI.json","view_paper":"https://pith.science/paper/5ITRBHDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8223&json=true","fetch_graph":"https://pith.science/api/pith-number/5ITRBHDSK3QVNZ7YDKVA3JOVCI/graph.json","fetch_events":"https://pith.science/api/pith-number/5ITRBHDSK3QVNZ7YDKVA3JOVCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI/action/storage_attestation","attest_author":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI/action/author_attestation","sign_citation":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI/action/citation_signature","submit_replication":"https://pith.science/pith/5ITRBHDSK3QVNZ7YDKVA3JOVCI/action/replication_record"}},"created_at":"2026-05-18T02:17:12.669981+00:00","updated_at":"2026-05-18T02:17:12.669981+00:00"}