{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LXXFO5IZGSMJTSFGQIT4OCXRN6","short_pith_number":"pith:LXXFO5IZ","schema_version":"1.0","canonical_sha256":"5dee577519349899c8a68227c70af16f8dec690daf7f2782f35fffd2c9ad83d4","source":{"kind":"arxiv","id":"2507.13994","version":1},"attestation_state":"computed","paper":{"title":"Optimal antimatroid sorting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Aram Berendsohn","submitted_at":"2025-07-18T15:02:46Z","abstract_excerpt":"The classical comparison-based sorting problem asks us to find the underlying total order of a given set of elements, where we can only access the elements via comparisons. In this paper, we study a restricted version, where, as a hint, a set $T$ of possible total orders is given, usually in some compressed form.\n  Recently, an algorithm called topological heapsort with optimal running time was found for the case where $T$ is the set of topological orderings of a given directed acyclic graph, or, equivalently, $T$ is the set of linear extensions of a given partial order [Haeupler et al. 2024]."},"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":"2507.13994","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T15:02:46Z","cross_cats_sorted":[],"title_canon_sha256":"14b49ac0b38f20bf23c6fb80c727bb921eb7c034ac4595c9cba2f169b1bc3dd2","abstract_canon_sha256":"e511c4687db5f74f0fdba953700f1d9baea5edb945ea96ababd0e07a0488c73c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:26.589707Z","signature_b64":"fg8khl6iA71rzK8b9LKMxh2U4VKWwxZYUFS7mLPcfPtmO7C8i4ydJHjNvTM/YAPVdl4Trm0swGp6R07sPROVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dee577519349899c8a68227c70af16f8dec690daf7f2782f35fffd2c9ad83d4","last_reissued_at":"2026-07-05T11:39:26.589219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:26.589219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal antimatroid sorting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Aram Berendsohn","submitted_at":"2025-07-18T15:02:46Z","abstract_excerpt":"The classical comparison-based sorting problem asks us to find the underlying total order of a given set of elements, where we can only access the elements via comparisons. In this paper, we study a restricted version, where, as a hint, a set $T$ of possible total orders is given, usually in some compressed form.\n  Recently, an algorithm called topological heapsort with optimal running time was found for the case where $T$ is the set of topological orderings of a given directed acyclic graph, or, equivalently, $T$ is the set of linear extensions of a given partial order [Haeupler et al. 2024]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13994","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/2507.13994/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":"2507.13994","created_at":"2026-07-05T11:39:26.589270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13994v1","created_at":"2026-07-05T11:39:26.589270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13994","created_at":"2026-07-05T11:39:26.589270+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXXFO5IZGSMJ","created_at":"2026-07-05T11:39:26.589270+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXXFO5IZGSMJTSFG","created_at":"2026-07-05T11:39:26.589270+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXXFO5IZ","created_at":"2026-07-05T11:39:26.589270+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/LXXFO5IZGSMJTSFGQIT4OCXRN6","json":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6.json","graph_json":"https://pith.science/api/pith-number/LXXFO5IZGSMJTSFGQIT4OCXRN6/graph.json","events_json":"https://pith.science/api/pith-number/LXXFO5IZGSMJTSFGQIT4OCXRN6/events.json","paper":"https://pith.science/paper/LXXFO5IZ"},"agent_actions":{"view_html":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6","download_json":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6.json","view_paper":"https://pith.science/paper/LXXFO5IZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13994&json=true","fetch_graph":"https://pith.science/api/pith-number/LXXFO5IZGSMJTSFGQIT4OCXRN6/graph.json","fetch_events":"https://pith.science/api/pith-number/LXXFO5IZGSMJTSFGQIT4OCXRN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6/action/storage_attestation","attest_author":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6/action/author_attestation","sign_citation":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6/action/citation_signature","submit_replication":"https://pith.science/pith/LXXFO5IZGSMJTSFGQIT4OCXRN6/action/replication_record"}},"created_at":"2026-07-05T11:39:26.589270+00:00","updated_at":"2026-07-05T11:39:26.589270+00:00"}