{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QJQ5WWQD7IXZUAAGQSLMNLRSYW","short_pith_number":"pith:QJQ5WWQD","schema_version":"1.0","canonical_sha256":"8261db5a03fa2f9a00068496c6ae32c59a988975f50d727648e519a56e7de541","source":{"kind":"arxiv","id":"1904.07729","version":1},"attestation_state":"computed","paper":{"title":"Latin cubes of even order with forbidden entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Johan Casselgren, Lan Anh Pham","submitted_at":"2019-04-15T13:21:58Z","abstract_excerpt":"We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $\\gamma > 0$ such that if $n=2t$ and $A$ is a $3$-dimensional $n\\times n\\times n$ array where every cell contains at most $\\gamma n$ symbols, and every symbol occurs at most $\\gamma n$ times in every line of $A$, then $A$ is {\\em avoidable}; that is, there is a Latin cube $L$ of order $n$ such that for every $1\\leq i,j,k\\leq n$, the symbol in position $(i,j,k)$ of $L$ does not appear in the corresponding cell of $A$."},"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":"1904.07729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T13:21:58Z","cross_cats_sorted":[],"title_canon_sha256":"72b559c57298140553d1892de53ce896d20dcd261e854689aadd781da783f1a3","abstract_canon_sha256":"f66307c63807be0d315442ca46195eb37e884a39f94d68d0da1ed902ab69f28b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:24.363909Z","signature_b64":"2QVXTgXGffh+8JOpYFwE6Lh3JoJcJIFsdsYSKxs4dwsH3LzYE+okkyy85Km7WveIQRXTbsiQ0p9txXp8K6AsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8261db5a03fa2f9a00068496c6ae32c59a988975f50d727648e519a56e7de541","last_reissued_at":"2026-05-17T23:48:24.363230Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:24.363230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latin cubes of even order with forbidden entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Johan Casselgren, Lan Anh Pham","submitted_at":"2019-04-15T13:21:58Z","abstract_excerpt":"We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $\\gamma > 0$ such that if $n=2t$ and $A$ is a $3$-dimensional $n\\times n\\times n$ array where every cell contains at most $\\gamma n$ symbols, and every symbol occurs at most $\\gamma n$ times in every line of $A$, then $A$ is {\\em avoidable}; that is, there is a Latin cube $L$ of order $n$ such that for every $1\\leq i,j,k\\leq n$, the symbol in position $(i,j,k)$ of $L$ does not appear in the corresponding cell of $A$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07729","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":"1904.07729","created_at":"2026-05-17T23:48:24.363331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07729v1","created_at":"2026-05-17T23:48:24.363331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07729","created_at":"2026-05-17T23:48:24.363331+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJQ5WWQD7IXZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJQ5WWQD7IXZUAAG","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJQ5WWQD","created_at":"2026-05-18T12:33:27.125529+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/QJQ5WWQD7IXZUAAGQSLMNLRSYW","json":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW.json","graph_json":"https://pith.science/api/pith-number/QJQ5WWQD7IXZUAAGQSLMNLRSYW/graph.json","events_json":"https://pith.science/api/pith-number/QJQ5WWQD7IXZUAAGQSLMNLRSYW/events.json","paper":"https://pith.science/paper/QJQ5WWQD"},"agent_actions":{"view_html":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW","download_json":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW.json","view_paper":"https://pith.science/paper/QJQ5WWQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07729&json=true","fetch_graph":"https://pith.science/api/pith-number/QJQ5WWQD7IXZUAAGQSLMNLRSYW/graph.json","fetch_events":"https://pith.science/api/pith-number/QJQ5WWQD7IXZUAAGQSLMNLRSYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW/action/storage_attestation","attest_author":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW/action/author_attestation","sign_citation":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW/action/citation_signature","submit_replication":"https://pith.science/pith/QJQ5WWQD7IXZUAAGQSLMNLRSYW/action/replication_record"}},"created_at":"2026-05-17T23:48:24.363331+00:00","updated_at":"2026-05-17T23:48:24.363331+00:00"}