{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KUXN7NLSJTQ33OBTQ5UIE3UFYW","short_pith_number":"pith:KUXN7NLS","schema_version":"1.0","canonical_sha256":"552edfb5724ce1bdb8338768826e85c5819e0e4391d242268e313f18204ab7e5","source":{"kind":"arxiv","id":"2401.03906","version":1},"attestation_state":"computed","paper":{"title":"Reconstruction of hypermatrices from subhypermatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenjie Zhong, Xiande Zhang","submitted_at":"2024-01-08T14:10:02Z","abstract_excerpt":"For a given $n$, what is the smallest number $k$ such that every sequence of length $n$ is determined by the multiset of all its $k$-subsequences? This is called the $k$-deck problem for sequence reconstruction, and has been generalized to the two-dimensional case -- reconstruction of $n\\times n$-matrices from submatrices. Previous works show that the smallest $k$ is at most $O(n^\\frac{1}{2})$ for sequences and at most $O(n^\\frac{2}{3})$ for matrices. We study this $k$-deck problem for general dimension $d$ and prove that, the smallest $k$ is at most $O(n^\\frac{d}{d+1})$ for reconstructing 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":"2401.03906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-08T14:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"8364566917d3b1ae2655477e06a7342dd98b8ce727990960038b7064fdf3e872","abstract_canon_sha256":"18ce318533c36a6657d106fc4bf7f9346b5b7084288670d01ec546630007e62a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:31:15.144967Z","signature_b64":"qxQrr01cMuXZZNut82yEbirxljl/Kkj4I7malb6SHJOv+hqFQ/xVgUfAMTwGaZSE/op88ovUBZpdZ65gh/zfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"552edfb5724ce1bdb8338768826e85c5819e0e4391d242268e313f18204ab7e5","last_reissued_at":"2026-07-05T07:31:15.144598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:31:15.144598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction of hypermatrices from subhypermatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenjie Zhong, Xiande Zhang","submitted_at":"2024-01-08T14:10:02Z","abstract_excerpt":"For a given $n$, what is the smallest number $k$ such that every sequence of length $n$ is determined by the multiset of all its $k$-subsequences? This is called the $k$-deck problem for sequence reconstruction, and has been generalized to the two-dimensional case -- reconstruction of $n\\times n$-matrices from submatrices. Previous works show that the smallest $k$ is at most $O(n^\\frac{1}{2})$ for sequences and at most $O(n^\\frac{2}{3})$ for matrices. We study this $k$-deck problem for general dimension $d$ and prove that, the smallest $k$ is at most $O(n^\\frac{d}{d+1})$ for reconstructing a $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03906","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.03906/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.03906","created_at":"2026-07-05T07:31:15.144650+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.03906v1","created_at":"2026-07-05T07:31:15.144650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03906","created_at":"2026-07-05T07:31:15.144650+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUXN7NLSJTQ3","created_at":"2026-07-05T07:31:15.144650+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUXN7NLSJTQ33OBT","created_at":"2026-07-05T07:31:15.144650+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUXN7NLS","created_at":"2026-07-05T07:31:15.144650+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/KUXN7NLSJTQ33OBTQ5UIE3UFYW","json":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW.json","graph_json":"https://pith.science/api/pith-number/KUXN7NLSJTQ33OBTQ5UIE3UFYW/graph.json","events_json":"https://pith.science/api/pith-number/KUXN7NLSJTQ33OBTQ5UIE3UFYW/events.json","paper":"https://pith.science/paper/KUXN7NLS"},"agent_actions":{"view_html":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW","download_json":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW.json","view_paper":"https://pith.science/paper/KUXN7NLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.03906&json=true","fetch_graph":"https://pith.science/api/pith-number/KUXN7NLSJTQ33OBTQ5UIE3UFYW/graph.json","fetch_events":"https://pith.science/api/pith-number/KUXN7NLSJTQ33OBTQ5UIE3UFYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/action/storage_attestation","attest_author":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/action/author_attestation","sign_citation":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/action/citation_signature","submit_replication":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/action/replication_record"}},"created_at":"2026-07-05T07:31:15.144650+00:00","updated_at":"2026-07-05T07:31:15.144650+00:00"}