{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QF7J6UAYZMGFNTAWHGVENLIU34","short_pith_number":"pith:QF7J6UAY","schema_version":"1.0","canonical_sha256":"817e9f5018cb0c56cc1639aa46ad14df3e3c22c1efbd0485f32bbb6397a75aad","source":{"kind":"arxiv","id":"2307.13161","version":1},"attestation_state":"computed","paper":{"title":"Young tableau reconstruction via minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Cordell Hammon, Daniel Herden, Indalecio Ruiz-Bolanos, Jasmin Mohn, Jonathan Meddaugh, Mark R. Sepanski, William Q. Erickson","submitted_at":"2023-07-24T22:57:15Z","abstract_excerpt":"The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to fill the resulting gap. This can be iterated to arrive at the set of $k$-minors of $T$. The problem is this: given $k$, what are the values of $n$ such that every tableau of size $n$ can be reconstructed from its set of $k$-minors? For $k=1$, the problem was recently solved by Cain and Lehtonen. In this paper, we solve the problem for $k=2$, proving the sha"},"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":"2307.13161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-24T22:57:15Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"311809b7b0190447232df2e08e3bb0a319973324d39039b88bfbdc9a1c0bba2d","abstract_canon_sha256":"a5a3f8141d9675691aba854f440975a2b4bd7397e1203f688511f7483cdd5868"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:09.698287Z","signature_b64":"gvIWY/x9cSDaiB253TgjQiaQbNvTUmB+56LM5n7yJwkAr7ZzJjRX5ts3N4mtZXLxHnpxs70pY5r+Rc4fJi3ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817e9f5018cb0c56cc1639aa46ad14df3e3c22c1efbd0485f32bbb6397a75aad","last_reissued_at":"2026-07-05T06:34:09.697825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:09.697825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Young tableau reconstruction via minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Cordell Hammon, Daniel Herden, Indalecio Ruiz-Bolanos, Jasmin Mohn, Jonathan Meddaugh, Mark R. Sepanski, William Q. Erickson","submitted_at":"2023-07-24T22:57:15Z","abstract_excerpt":"The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to fill the resulting gap. This can be iterated to arrive at the set of $k$-minors of $T$. The problem is this: given $k$, what are the values of $n$ such that every tableau of size $n$ can be reconstructed from its set of $k$-minors? For $k=1$, the problem was recently solved by Cain and Lehtonen. In this paper, we solve the problem for $k=2$, proving the sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13161","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/2307.13161/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":"2307.13161","created_at":"2026-07-05T06:34:09.697898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13161v1","created_at":"2026-07-05T06:34:09.697898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13161","created_at":"2026-07-05T06:34:09.697898+00:00"},{"alias_kind":"pith_short_12","alias_value":"QF7J6UAYZMGF","created_at":"2026-07-05T06:34:09.697898+00:00"},{"alias_kind":"pith_short_16","alias_value":"QF7J6UAYZMGFNTAW","created_at":"2026-07-05T06:34:09.697898+00:00"},{"alias_kind":"pith_short_8","alias_value":"QF7J6UAY","created_at":"2026-07-05T06:34:09.697898+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/QF7J6UAYZMGFNTAWHGVENLIU34","json":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34.json","graph_json":"https://pith.science/api/pith-number/QF7J6UAYZMGFNTAWHGVENLIU34/graph.json","events_json":"https://pith.science/api/pith-number/QF7J6UAYZMGFNTAWHGVENLIU34/events.json","paper":"https://pith.science/paper/QF7J6UAY"},"agent_actions":{"view_html":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34","download_json":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34.json","view_paper":"https://pith.science/paper/QF7J6UAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13161&json=true","fetch_graph":"https://pith.science/api/pith-number/QF7J6UAYZMGFNTAWHGVENLIU34/graph.json","fetch_events":"https://pith.science/api/pith-number/QF7J6UAYZMGFNTAWHGVENLIU34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34/action/storage_attestation","attest_author":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34/action/author_attestation","sign_citation":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34/action/citation_signature","submit_replication":"https://pith.science/pith/QF7J6UAYZMGFNTAWHGVENLIU34/action/replication_record"}},"created_at":"2026-07-05T06:34:09.697898+00:00","updated_at":"2026-07-05T06:34:09.697898+00:00"}