{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N3QRWQT3MGKBCJVENKZSLRXBZL","short_pith_number":"pith:N3QRWQT3","canonical_record":{"source":{"id":"2512.07349","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-08T09:41:47Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2a4ab979864cd7289ee6a6918bf20ba29997f5b9a3d51efb3d307ea387526afd","abstract_canon_sha256":"2fb419980c79a13ed5da139bfbea23d42d392bf59abd8fd4a4ab97c3171240ed"},"schema_version":"1.0"},"canonical_sha256":"6ee11b427b61941126a46ab325c6e1cad4c415137b2ce0e5d94f11f761d12b8e","source":{"kind":"arxiv","id":"2512.07349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.07349","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2512.07349v2","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.07349","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"N3QRWQT3MGKB","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"N3QRWQT3MGKBCJVE","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"N3QRWQT3","created_at":"2026-06-02T02:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N3QRWQT3MGKBCJVENKZSLRXBZL","target":"record","payload":{"canonical_record":{"source":{"id":"2512.07349","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-08T09:41:47Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2a4ab979864cd7289ee6a6918bf20ba29997f5b9a3d51efb3d307ea387526afd","abstract_canon_sha256":"2fb419980c79a13ed5da139bfbea23d42d392bf59abd8fd4a4ab97c3171240ed"},"schema_version":"1.0"},"canonical_sha256":"6ee11b427b61941126a46ab325c6e1cad4c415137b2ce0e5d94f11f761d12b8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:49.408157Z","signature_b64":"q2N3htaX3bus24gdvjPTGl/3PJjjRQC50AJJUz/6RwPhIUupVDpyC+oslRaMZojTN18DSP4XDJCkcf3G3SsJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee11b427b61941126a46ab325c6e1cad4c415137b2ce0e5d94f11f761d12b8e","last_reissued_at":"2026-06-02T02:04:49.407651Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:49.407651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.07349","source_version":2,"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-06-02T02:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cnk3srjqxCamsRuvCrJNlz0eAP7f9Pyp5vZVx/ahBOgzjw5iyctJR5dxO1esJzP8+FMKG71Biaq9Qm0QKhVDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:46:02.322388Z"},"content_sha256":"5df4a5b9fabf2855c1bb1fdd7d62476403b5753a3214e942bbb11cf4760ad138","schema_version":"1.0","event_id":"sha256:5df4a5b9fabf2855c1bb1fdd7d62476403b5753a3214e942bbb11cf4760ad138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N3QRWQT3MGKBCJVENKZSLRXBZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetries in Sorting","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Vikraman Choudhury, Wind Wong","submitted_at":"2025-12-08T09:41:47Z","abstract_excerpt":"Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions, they are functions on lists that perform combinatorial operations on the representation of the input list. In this paper, we study sorting algorithms conceptually as abstract sorting functions.\n  There is a canonical surjection from the free monoid on a set (lists of elements) to the free commutative monoid on the same set (multisets of elements). We show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.07349","kind":"arxiv","version":2},"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/2512.07349/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-06-02T02:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D24Yii7g9m99ARU8FMa10K3F4dpg2YTV9DpywrBBtttfh+jDP5EbqpVyWVq3Cs6SPZ1AT7FWtglJ86M1TgzCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:46:02.322765Z"},"content_sha256":"a991fb8f6bbc6db16ea0522fb6b515c6c425aa870d52215778bb327d76ad46f2","schema_version":"1.0","event_id":"sha256:a991fb8f6bbc6db16ea0522fb6b515c6c425aa870d52215778bb327d76ad46f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3QRWQT3MGKBCJVENKZSLRXBZL/bundle.json","state_url":"https://pith.science/pith/N3QRWQT3MGKBCJVENKZSLRXBZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3QRWQT3MGKBCJVENKZSLRXBZL/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-22T22:46:02Z","links":{"resolver":"https://pith.science/pith/N3QRWQT3MGKBCJVENKZSLRXBZL","bundle":"https://pith.science/pith/N3QRWQT3MGKBCJVENKZSLRXBZL/bundle.json","state":"https://pith.science/pith/N3QRWQT3MGKBCJVENKZSLRXBZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3QRWQT3MGKBCJVENKZSLRXBZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N3QRWQT3MGKBCJVENKZSLRXBZL","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":"2fb419980c79a13ed5da139bfbea23d42d392bf59abd8fd4a4ab97c3171240ed","cross_cats_sorted":["math.LO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-08T09:41:47Z","title_canon_sha256":"2a4ab979864cd7289ee6a6918bf20ba29997f5b9a3d51efb3d307ea387526afd"},"schema_version":"1.0","source":{"id":"2512.07349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.07349","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2512.07349v2","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.07349","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"N3QRWQT3MGKB","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"N3QRWQT3MGKBCJVE","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"N3QRWQT3","created_at":"2026-06-02T02:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:a991fb8f6bbc6db16ea0522fb6b515c6c425aa870d52215778bb327d76ad46f2","target":"graph","created_at":"2026-06-02T02:04:49Z","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/2512.07349/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions, they are functions on lists that perform combinatorial operations on the representation of the input list. In this paper, we study sorting algorithms conceptually as abstract sorting functions.\n  There is a canonical surjection from the free monoid on a set (lists of elements) to the free commutative monoid on the same set (multisets of elements). We show th","authors_text":"Vikraman Choudhury, Wind Wong","cross_cats":["math.LO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-08T09:41:47Z","title":"Symmetries in Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.07349","kind":"arxiv","version":2},"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:5df4a5b9fabf2855c1bb1fdd7d62476403b5753a3214e942bbb11cf4760ad138","target":"record","created_at":"2026-06-02T02:04:49Z","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":"2fb419980c79a13ed5da139bfbea23d42d392bf59abd8fd4a4ab97c3171240ed","cross_cats_sorted":["math.LO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-08T09:41:47Z","title_canon_sha256":"2a4ab979864cd7289ee6a6918bf20ba29997f5b9a3d51efb3d307ea387526afd"},"schema_version":"1.0","source":{"id":"2512.07349","kind":"arxiv","version":2}},"canonical_sha256":"6ee11b427b61941126a46ab325c6e1cad4c415137b2ce0e5d94f11f761d12b8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ee11b427b61941126a46ab325c6e1cad4c415137b2ce0e5d94f11f761d12b8e","first_computed_at":"2026-06-02T02:04:49.407651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:49.407651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q2N3htaX3bus24gdvjPTGl/3PJjjRQC50AJJUz/6RwPhIUupVDpyC+oslRaMZojTN18DSP4XDJCkcf3G3SsJBw==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:49.408157Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.07349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5df4a5b9fabf2855c1bb1fdd7d62476403b5753a3214e942bbb11cf4760ad138","sha256:a991fb8f6bbc6db16ea0522fb6b515c6c425aa870d52215778bb327d76ad46f2"],"state_sha256":"5bccd35fabcebb316ecd6a0f66ad6042f22a851b51d64b205911e87469ffdf81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oo7gcvminiqM34dtxzWig5+/9tr2BBh5apW+Hg0fC+qrPK+x/0w+PmsYXT23BVhjHmmgUceG7raWp4tJNZV+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:46:02.324734Z","bundle_sha256":"ac5603903cccfed9a3463b88d6794e471569e012d305abef51caaaef576d8804"}}