{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:SHYN73VZKMVO5CBQTDBZEYNAHZ","short_pith_number":"pith:SHYN73VZ","schema_version":"1.0","canonical_sha256":"91f0dfeeb9532aee883098c39261a03e55b9352793ca348afbeb92b9720f88b8","source":{"kind":"arxiv","id":"math/0005235","version":1},"attestation_state":"computed","paper":{"title":"Smoothness and decay properties of the limiting Quicksort density function","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"James Allen Fill (Johns Hopkins Univ.), Svante Janson (Uppsala Univ.)","submitted_at":"2000-05-23T19:24:59Z","abstract_excerpt":"Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f, and that each derivative f^{(k)} enjoys superpolynomial decay at plus and minus infinity. In particular, each f^{(k)} is bounded. Our method is sufficiently computational to prove, for example, that f is bounded by 16."},"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":"math/0005235","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2000-05-23T19:24:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fa4ee2df4edd5fb720ea25f9124564defff2e29d3e1d7b2fb4b8061b4db6d87e","abstract_canon_sha256":"1fc49a1b7ecae673e5add990f29f3ac67c79d7f4ac40f423f19c038b777d3efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:34:31.497235Z","signature_b64":"szvVieZbt9b5oU5q8JmjwjZxlvdc/97GRgP4HhSUztoTBrbL7eeJdq+TVUnwjSEBWN/VeBv2OvPSgzStVCb0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f0dfeeb9532aee883098c39261a03e55b9352793ca348afbeb92b9720f88b8","last_reissued_at":"2026-07-04T14:34:31.496887Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:34:31.496887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothness and decay properties of the limiting Quicksort density function","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"James Allen Fill (Johns Hopkins Univ.), Svante Janson (Uppsala Univ.)","submitted_at":"2000-05-23T19:24:59Z","abstract_excerpt":"Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f, and that each derivative f^{(k)} enjoys superpolynomial decay at plus and minus infinity. In particular, each f^{(k)} is bounded. Our method is sufficiently computational to prove, for example, that f is bounded by 16."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005235","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/math/0005235/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":"math/0005235","created_at":"2026-07-04T14:34:31.496949+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0005235v1","created_at":"2026-07-04T14:34:31.496949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005235","created_at":"2026-07-04T14:34:31.496949+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHYN73VZKMVO","created_at":"2026-07-04T14:34:31.496949+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHYN73VZKMVO5CBQ","created_at":"2026-07-04T14:34:31.496949+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHYN73VZ","created_at":"2026-07-04T14:34:31.496949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02873","citing_title":"Using Large Language Models to Study Mathematical Practice","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ","json":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ.json","graph_json":"https://pith.science/api/pith-number/SHYN73VZKMVO5CBQTDBZEYNAHZ/graph.json","events_json":"https://pith.science/api/pith-number/SHYN73VZKMVO5CBQTDBZEYNAHZ/events.json","paper":"https://pith.science/paper/SHYN73VZ"},"agent_actions":{"view_html":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ","download_json":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ.json","view_paper":"https://pith.science/paper/SHYN73VZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0005235&json=true","fetch_graph":"https://pith.science/api/pith-number/SHYN73VZKMVO5CBQTDBZEYNAHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SHYN73VZKMVO5CBQTDBZEYNAHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ/action/storage_attestation","attest_author":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ/action/author_attestation","sign_citation":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ/action/citation_signature","submit_replication":"https://pith.science/pith/SHYN73VZKMVO5CBQTDBZEYNAHZ/action/replication_record"}},"created_at":"2026-07-04T14:34:31.496949+00:00","updated_at":"2026-07-04T14:34:31.496949+00:00"}