{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SNFERR42G2RV326W6XKTSVOPF2","short_pith_number":"pith:SNFERR42","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"},"canonical_sha256":"934a48c79a36a35debd6f5d53955cf2e8c10a21e14569ed444b5736b648c4a8f","source":{"kind":"arxiv","id":"1406.1196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1196","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1196v1","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1196","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"SNFERR42G2RV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SNFERR42G2RV326W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SNFERR42","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SNFERR42G2RV326W6XKTSVOPF2","target":"record","payload":{"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"},"canonical_sha256":"934a48c79a36a35debd6f5d53955cf2e8c10a21e14569ed444b5736b648c4a8f","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"},"source_kind":"arxiv","source_id":"1406.1196","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-05-18T02:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CpCFcVZv5LIOphS5nJZ/nWGCTJA47CFRe+8meZlP7UwcpWGhRuNwhr2NMOnmQvTJKY9ZSQByD8n+w3wap2IKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:00:49.962104Z"},"content_sha256":"ecab3f2e732b725b207eff91b65da3c3af5e50a7016ed595fe5e23de66352b8b","schema_version":"1.0","event_id":"sha256:ecab3f2e732b725b207eff91b65da3c3af5e50a7016ed595fe5e23de66352b8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SNFERR42G2RV326W6XKTSVOPF2","target":"graph","payload":{"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"},"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-05-18T02:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5PKXJ4OQxzvOpaWWuuaSAa6OEV0aH7KO0AXvPW+4IPNsAkCBREpDh0UOtpugwzJKBoVA2cgB6xil64Uw3GBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:00:49.962836Z"},"content_sha256":"37c9e8af141d45e10eb26ae8ca300f9fc768fa2eed478bcf049501b590a8248e","schema_version":"1.0","event_id":"sha256:37c9e8af141d45e10eb26ae8ca300f9fc768fa2eed478bcf049501b590a8248e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/bundle.json","state_url":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNFERR42G2RV326W6XKTSVOPF2/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-06-10T01:00:49Z","links":{"resolver":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2","bundle":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/bundle.json","state":"https://pith.science/pith/SNFERR42G2RV326W6XKTSVOPF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNFERR42G2RV326W6XKTSVOPF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SNFERR42G2RV326W6XKTSVOPF2","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":"630d0b090ea2ada5523b7b6e0eff0da000704b52f58843ada069afa53ff4df48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-04T20:04:00Z","title_canon_sha256":"f4c3c3e0c6f37af6112c4727e83daa327fae687634cc65348b9737bbeffb0340"},"schema_version":"1.0","source":{"id":"1406.1196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1196","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1196v1","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1196","created_at":"2026-05-18T02:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"SNFERR42G2RV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SNFERR42G2RV326W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SNFERR42","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:37c9e8af141d45e10eb26ae8ca300f9fc768fa2eed478bcf049501b590a8248e","target":"graph","created_at":"2026-05-18T02:50:24Z","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"},"paper":{"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","authors_text":"Drew Armstrong, Gregory S. Warrington, Nicholas A. Loehr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-04T20:04:00Z","title":"Sweep maps: A continuous family of sorting algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1196","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:ecab3f2e732b725b207eff91b65da3c3af5e50a7016ed595fe5e23de66352b8b","target":"record","created_at":"2026-05-18T02:50:24Z","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":"630d0b090ea2ada5523b7b6e0eff0da000704b52f58843ada069afa53ff4df48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-04T20:04:00Z","title_canon_sha256":"f4c3c3e0c6f37af6112c4727e83daa327fae687634cc65348b9737bbeffb0340"},"schema_version":"1.0","source":{"id":"1406.1196","kind":"arxiv","version":1}},"canonical_sha256":"934a48c79a36a35debd6f5d53955cf2e8c10a21e14569ed444b5736b648c4a8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"934a48c79a36a35debd6f5d53955cf2e8c10a21e14569ed444b5736b648c4a8f","first_computed_at":"2026-05-18T02:50:24.686516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:24.686516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hRa35xbUhGOPePVuzKioXe719PtSHvAJqkcLrLF3NQp/JDTnmp08SJK3cT8Tim6Puh6BuZU8LnZYavv5fbZpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:24.687083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecab3f2e732b725b207eff91b65da3c3af5e50a7016ed595fe5e23de66352b8b","sha256:37c9e8af141d45e10eb26ae8ca300f9fc768fa2eed478bcf049501b590a8248e"],"state_sha256":"ddd220c2e25dcab3c3e0c922e6b5b9c7113145f0e0f73ff142988f474e4d2b84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCKMbj5EvfIhzhW/av0EvMwKdlBzgVUlomLgMZQsys7gFpUinBx4jkYgQLs/BysHhG+vk1qmnAkX2lMeuawMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:00:49.966588Z","bundle_sha256":"b29133698008224eb895bd452f42521d411b15c55d0d54f9274d090d83bd4a41"}}