{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KUXN7NLSJTQ33OBTQ5UIE3UFYW","short_pith_number":"pith:KUXN7NLS","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"},"canonical_sha256":"552edfb5724ce1bdb8338768826e85c5819e0e4391d242268e313f18204ab7e5","source":{"kind":"arxiv","id":"2401.03906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.03906","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.03906v1","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03906","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"pith_short_12","alias_value":"KUXN7NLSJTQ3","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"KUXN7NLSJTQ33OBT","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"KUXN7NLS","created_at":"2026-07-05T07:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KUXN7NLSJTQ33OBTQ5UIE3UFYW","target":"record","payload":{"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"},"canonical_sha256":"552edfb5724ce1bdb8338768826e85c5819e0e4391d242268e313f18204ab7e5","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"},"source_kind":"arxiv","source_id":"2401.03906","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:31:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YmOVqaQooExCx9kxgPPdWAG+fZu9L788q9W+sfB7BJmQYAhzEvrmqjQUOapKSg8cwtkDBCKtJjxAhLlB1/MBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:29:55.524456Z"},"content_sha256":"0a466e2575197d85398732133cf1c4267c5076e24edcce64755f2fecb1be489c","schema_version":"1.0","event_id":"sha256:0a466e2575197d85398732133cf1c4267c5076e24edcce64755f2fecb1be489c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KUXN7NLSJTQ33OBTQ5UIE3UFYW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:31:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZrEmwcp4y3/NWztumrHF7TEyQe8/v1Sc1XSNbq7v195qci0TB1RsdjdISicK4NDBOiyBYWXvearYOVcTigwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:29:55.524953Z"},"content_sha256":"27c0ac0fcf2f691964dca290311822ff27963907036c2a2dc849b6f96197e86d","schema_version":"1.0","event_id":"sha256:27c0ac0fcf2f691964dca290311822ff27963907036c2a2dc849b6f96197e86d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/bundle.json","state_url":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T14:29:55Z","links":{"resolver":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW","bundle":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/bundle.json","state":"https://pith.science/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUXN7NLSJTQ33OBTQ5UIE3UFYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KUXN7NLSJTQ33OBTQ5UIE3UFYW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"18ce318533c36a6657d106fc4bf7f9346b5b7084288670d01ec546630007e62a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-08T14:10:02Z","title_canon_sha256":"8364566917d3b1ae2655477e06a7342dd98b8ce727990960038b7064fdf3e872"},"schema_version":"1.0","source":{"id":"2401.03906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.03906","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.03906v1","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03906","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"pith_short_12","alias_value":"KUXN7NLSJTQ3","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"KUXN7NLSJTQ33OBT","created_at":"2026-07-05T07:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"KUXN7NLS","created_at":"2026-07-05T07:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:27c0ac0fcf2f691964dca290311822ff27963907036c2a2dc849b6f96197e86d","target":"graph","created_at":"2026-07-05T07:31:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.03906/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 $","authors_text":"Wenjie Zhong, Xiande Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-08T14:10:02Z","title":"Reconstruction of hypermatrices from subhypermatrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03906","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a466e2575197d85398732133cf1c4267c5076e24edcce64755f2fecb1be489c","target":"record","created_at":"2026-07-05T07:31:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"18ce318533c36a6657d106fc4bf7f9346b5b7084288670d01ec546630007e62a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-08T14:10:02Z","title_canon_sha256":"8364566917d3b1ae2655477e06a7342dd98b8ce727990960038b7064fdf3e872"},"schema_version":"1.0","source":{"id":"2401.03906","kind":"arxiv","version":1}},"canonical_sha256":"552edfb5724ce1bdb8338768826e85c5819e0e4391d242268e313f18204ab7e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"552edfb5724ce1bdb8338768826e85c5819e0e4391d242268e313f18204ab7e5","first_computed_at":"2026-07-05T07:31:15.144598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:31:15.144598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qxQrr01cMuXZZNut82yEbirxljl/Kkj4I7malb6SHJOv+hqFQ/xVgUfAMTwGaZSE/op88ovUBZpdZ65gh/zfAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:31:15.144967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.03906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a466e2575197d85398732133cf1c4267c5076e24edcce64755f2fecb1be489c","sha256:27c0ac0fcf2f691964dca290311822ff27963907036c2a2dc849b6f96197e86d"],"state_sha256":"f97a046a92e2d56f167c0dfcfef73380e6aad7f2abd1261833d99a2b556be53a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XX3ZgAj/Mn8pk8UQa9mvoLvPcI9i/Al3GClLJp6CpcohiFQHvJ1ALGZDO/uIWRYwk/zpjxHJrMPAZiKaji1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:29:55.530024Z","bundle_sha256":"d35157511d1b90af723a280bfe5152ab92f396c503a5e390abf3ac00fcd86d39"}}