{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CXGGWSMPFKJVU6K6LVFVENPH7S","short_pith_number":"pith:CXGGWSMP","schema_version":"1.0","canonical_sha256":"15cc6b498f2a935a795e5d4b5235e7fcaedb09067f0f5880d760a4e502d5e036","source":{"kind":"arxiv","id":"1807.07458","version":1},"attestation_state":"computed","paper":{"title":"On the Sweep Map for Fuss Rational Dyck Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriano M. Garsia, Guoce Xin","submitted_at":"2018-07-19T14:18:40Z","abstract_excerpt":"Our main contribution here is the discovery of a new family of standard Young tableaux $ {\\cal T}^k_n$ which are in bijection with the family ${\\cal D}_{m,n}$ of Rational Dyck paths for $m=k\\times n\\pm 1$ (the so called \"Fuss\" case). Using this family we give a new proof of the invertibility of the sweep map in the Fuss case by means of a very simple explicit algorithm. This new algorithm has running time $O(m+n)$. It is independent of the Thomas-William algorithm."},"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":"1807.07458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-19T14:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"ebea00651c2c5dab44a0a01f37c4c7ca03c978e98bf09711addea8bf08b137fb","abstract_canon_sha256":"a3fc41bce6068f8c85b1e69982b594b31a4b3c3896a1167b5f3f377ac278bacc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:20.108461Z","signature_b64":"OHrZFmv42V7VwOHtbNwDg7QD6zBMYsIRlMzuQHlEkkFSV9Y4PwKKOxRiaWGL/t8fSqhCiFKJCaIbcD+LdtnmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15cc6b498f2a935a795e5d4b5235e7fcaedb09067f0f5880d760a4e502d5e036","last_reissued_at":"2026-05-18T00:10:20.107771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:20.107771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sweep Map for Fuss Rational Dyck Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriano M. Garsia, Guoce Xin","submitted_at":"2018-07-19T14:18:40Z","abstract_excerpt":"Our main contribution here is the discovery of a new family of standard Young tableaux $ {\\cal T}^k_n$ which are in bijection with the family ${\\cal D}_{m,n}$ of Rational Dyck paths for $m=k\\times n\\pm 1$ (the so called \"Fuss\" case). Using this family we give a new proof of the invertibility of the sweep map in the Fuss case by means of a very simple explicit algorithm. This new algorithm has running time $O(m+n)$. It is independent of the Thomas-William algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07458","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":"1807.07458","created_at":"2026-05-18T00:10:20.107870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07458v1","created_at":"2026-05-18T00:10:20.107870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07458","created_at":"2026-05-18T00:10:20.107870+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXGGWSMPFKJV","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXGGWSMPFKJVU6K6","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXGGWSMP","created_at":"2026-05-18T12:32:19.392346+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/CXGGWSMPFKJVU6K6LVFVENPH7S","json":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S.json","graph_json":"https://pith.science/api/pith-number/CXGGWSMPFKJVU6K6LVFVENPH7S/graph.json","events_json":"https://pith.science/api/pith-number/CXGGWSMPFKJVU6K6LVFVENPH7S/events.json","paper":"https://pith.science/paper/CXGGWSMP"},"agent_actions":{"view_html":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S","download_json":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S.json","view_paper":"https://pith.science/paper/CXGGWSMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07458&json=true","fetch_graph":"https://pith.science/api/pith-number/CXGGWSMPFKJVU6K6LVFVENPH7S/graph.json","fetch_events":"https://pith.science/api/pith-number/CXGGWSMPFKJVU6K6LVFVENPH7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S/action/storage_attestation","attest_author":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S/action/author_attestation","sign_citation":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S/action/citation_signature","submit_replication":"https://pith.science/pith/CXGGWSMPFKJVU6K6LVFVENPH7S/action/replication_record"}},"created_at":"2026-05-18T00:10:20.107870+00:00","updated_at":"2026-05-18T00:10:20.107870+00:00"}