{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R56X5UQMV6SDNCUOJK7G6POOE3","short_pith_number":"pith:R56X5UQM","schema_version":"1.0","canonical_sha256":"8f7d7ed20cafa4368a8e4abe6f3dce26d21a4775967a8de183599b8b7b7f2fa0","source":{"kind":"arxiv","id":"1401.2022","version":1},"attestation_state":"computed","paper":{"title":"The completion of optimal $(3,4)$-packings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingjun Bao, Lijun Ji","submitted_at":"2014-01-09T14:56:14Z","abstract_excerpt":"A 3-$(n,4,1)$ packing design consists of an $n$-element set $X$ and a collection of $4$-element subsets of $X$, called {\\it blocks}, such that every $3$-element subset of $X$ is contained in at most one block. The packing number of quadruples $d(3,4,n)$ denotes the number of blocks in a maximum $3$-$(n,4,1)$ packing design, which is also the maximum number $A(n,4,4)$ of codewords in a code of length $n$, constant weight $4$, and minimum Hamming distance 4. In this paper the undecided 21 packing numbers $A(n,4,4)$ are shown to be equal to Johnson bound $J(n,4,4)$ $( =\\lfloor\\frac{n}{4}\\lfloor\\f"},"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":"1401.2022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-09T14:56:14Z","cross_cats_sorted":[],"title_canon_sha256":"41bb3e58273d0eb6d36b69c530afc486bafc913b28a093beca11ca0c5ae80229","abstract_canon_sha256":"75f7349774c2fe4b4b533aeafa64b97bb003eeab98c6ed6b41d795f4dfaead87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:47.748750Z","signature_b64":"9xIV5TeFMF3nGanSzt47FwWf3VN4DEol8nTvoWV0l0HdU3s0lzefd3jowxbPtXWu8lMiO6I4/FZJWAVIz9lgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7d7ed20cafa4368a8e4abe6f3dce26d21a4775967a8de183599b8b7b7f2fa0","last_reissued_at":"2026-05-18T03:02:47.748069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:47.748069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The completion of optimal $(3,4)$-packings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingjun Bao, Lijun Ji","submitted_at":"2014-01-09T14:56:14Z","abstract_excerpt":"A 3-$(n,4,1)$ packing design consists of an $n$-element set $X$ and a collection of $4$-element subsets of $X$, called {\\it blocks}, such that every $3$-element subset of $X$ is contained in at most one block. The packing number of quadruples $d(3,4,n)$ denotes the number of blocks in a maximum $3$-$(n,4,1)$ packing design, which is also the maximum number $A(n,4,4)$ of codewords in a code of length $n$, constant weight $4$, and minimum Hamming distance 4. In this paper the undecided 21 packing numbers $A(n,4,4)$ are shown to be equal to Johnson bound $J(n,4,4)$ $( =\\lfloor\\frac{n}{4}\\lfloor\\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2022","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":"1401.2022","created_at":"2026-05-18T03:02:47.748162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2022v1","created_at":"2026-05-18T03:02:47.748162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2022","created_at":"2026-05-18T03:02:47.748162+00:00"},{"alias_kind":"pith_short_12","alias_value":"R56X5UQMV6SD","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R56X5UQMV6SDNCUO","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R56X5UQM","created_at":"2026-05-18T12:28:46.137349+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/R56X5UQMV6SDNCUOJK7G6POOE3","json":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3.json","graph_json":"https://pith.science/api/pith-number/R56X5UQMV6SDNCUOJK7G6POOE3/graph.json","events_json":"https://pith.science/api/pith-number/R56X5UQMV6SDNCUOJK7G6POOE3/events.json","paper":"https://pith.science/paper/R56X5UQM"},"agent_actions":{"view_html":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3","download_json":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3.json","view_paper":"https://pith.science/paper/R56X5UQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2022&json=true","fetch_graph":"https://pith.science/api/pith-number/R56X5UQMV6SDNCUOJK7G6POOE3/graph.json","fetch_events":"https://pith.science/api/pith-number/R56X5UQMV6SDNCUOJK7G6POOE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3/action/storage_attestation","attest_author":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3/action/author_attestation","sign_citation":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3/action/citation_signature","submit_replication":"https://pith.science/pith/R56X5UQMV6SDNCUOJK7G6POOE3/action/replication_record"}},"created_at":"2026-05-18T03:02:47.748162+00:00","updated_at":"2026-05-18T03:02:47.748162+00:00"}