{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SNFERR42G2RV326W6XKTSVOPF2","short_pith_number":"pith:SNFERR42","schema_version":"1.0","canonical_sha256":"934a48c79a36a35debd6f5d53955cf2e8c10a21e14569ed444b5736b648c4a8f","source":{"kind":"arxiv","id":"1406.1196","version":1},"attestation_state":"computed","paper":{"title":"Sweep maps: A continuous family of sorting algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Drew Armstrong, Gregory S. Warrington, Nicholas A. Loehr","submitted_at":"2014-06-04T20:04:00Z","abstract_excerpt":"We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general. The sweep maps give concise combinatorial formulas for the q,t-Catalan numbers, the higher q,t-Catalan numbers, the q,t-square numbers, and many more general polynomials connected to the nabla operator and rational Catalan combinatorics. We prove that many algorithms that have appeared in the literature (including maps studied by Andrews, Egge, Gorsky, Haglun"},"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":"1406.1196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-04T20:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"f4c3c3e0c6f37af6112c4727e83daa327fae687634cc65348b9737bbeffb0340","abstract_canon_sha256":"630d0b090ea2ada5523b7b6e0eff0da000704b52f58843ada069afa53ff4df48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:24.687083Z","signature_b64":"hRa35xbUhGOPePVuzKioXe719PtSHvAJqkcLrLF3NQp/JDTnmp08SJK3cT8Tim6Puh6BuZU8LnZYavv5fbZpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"934a48c79a36a35debd6f5d53955cf2e8c10a21e14569ed444b5736b648c4a8f","last_reissued_at":"2026-05-18T02:50:24.686516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:24.686516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sweep maps: A continuous family of sorting algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Drew Armstrong, Gregory S. Warrington, Nicholas A. Loehr","submitted_at":"2014-06-04T20:04:00Z","abstract_excerpt":"We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general. The sweep maps give concise combinatorial formulas for the q,t-Catalan numbers, the higher q,t-Catalan numbers, the q,t-square numbers, and many more general polynomials connected to the nabla operator and rational Catalan combinatorics. We prove that many algorithms that have appeared in the literature (including maps studied by Andrews, Egge, Gorsky, Haglun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1196","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":"1406.1196","created_at":"2026-05-18T02:50:24.686590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1196v1","created_at":"2026-05-18T02:50:24.686590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1196","created_at":"2026-05-18T02:50:24.686590+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNFERR42G2RV","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNFERR42G2RV326W","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNFERR42","created_at":"2026-05-18T12:28:49.207871+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/SNFERR42G2RV326W6XKTSVOPF2","json":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2.json","graph_json":"https://pith.science/api/pith-number/SNFERR42G2RV326W6XKTSVOPF2/graph.json","events_json":"https://pith.science/api/pith-number/SNFERR42G2RV326W6XKTSVOPF2/events.json","paper":"https://pith.science/paper/SNFERR42"},"agent_actions":{"view_html":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2","download_json":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2.json","view_paper":"https://pith.science/paper/SNFERR42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1196&json=true","fetch_graph":"https://pith.science/api/pith-number/SNFERR42G2RV326W6XKTSVOPF2/graph.json","fetch_events":"https://pith.science/api/pith-number/SNFERR42G2RV326W6XKTSVOPF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/action/storage_attestation","attest_author":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/action/author_attestation","sign_citation":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/action/citation_signature","submit_replication":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/action/replication_record"}},"created_at":"2026-05-18T02:50:24.686590+00:00","updated_at":"2026-05-18T02:50:24.686590+00:00"}