{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y6ADJVB55FNVJCXO4IOBUQABMG","short_pith_number":"pith:Y6ADJVB5","schema_version":"1.0","canonical_sha256":"c78034d43de95b548aeee21c1a4001618832dc60e9e2d2fbdf98b4d5b16f7720","source":{"kind":"arxiv","id":"1702.06444","version":1},"attestation_state":"computed","paper":{"title":"Almost-sure asymptotic for the number of heaps inside a random sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anne-Laure Basdevant (MODAL'X), Arvind Singh (LM-Orsay)","submitted_at":"2017-02-21T15:40:51Z","abstract_excerpt":"We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In this note, we improve on the previous result by establishing the almost-sure and L 1 convergence."},"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":"1702.06444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-21T15:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"9ac8e52baf363e7f25f315d26eb447365535624579b123c9e2b8ae62630a3000","abstract_canon_sha256":"4f1f6f75a9de4aadf67b20d1dabebc03799216f62b6c0b84165b448c7341ad00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.124701Z","signature_b64":"42MzRUsThR3+KTwX+AWzusl/v88YnXu4AIoqd1VxlBt0vgSr0vhhIGwLid/48LJXvHN1x7dEcEQzY/sMPpe8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78034d43de95b548aeee21c1a4001618832dc60e9e2d2fbdf98b4d5b16f7720","last_reissued_at":"2026-05-18T00:50:14.124128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.124128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-sure asymptotic for the number of heaps inside a random sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anne-Laure Basdevant (MODAL'X), Arvind Singh (LM-Orsay)","submitted_at":"2017-02-21T15:40:51Z","abstract_excerpt":"We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In this note, we improve on the previous result by establishing the almost-sure and L 1 convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06444","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":"1702.06444","created_at":"2026-05-18T00:50:14.124219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06444v1","created_at":"2026-05-18T00:50:14.124219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06444","created_at":"2026-05-18T00:50:14.124219+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6ADJVB55FNV","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6ADJVB55FNVJCXO","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6ADJVB5","created_at":"2026-05-18T12:31:56.362134+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/Y6ADJVB55FNVJCXO4IOBUQABMG","json":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG.json","graph_json":"https://pith.science/api/pith-number/Y6ADJVB55FNVJCXO4IOBUQABMG/graph.json","events_json":"https://pith.science/api/pith-number/Y6ADJVB55FNVJCXO4IOBUQABMG/events.json","paper":"https://pith.science/paper/Y6ADJVB5"},"agent_actions":{"view_html":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG","download_json":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG.json","view_paper":"https://pith.science/paper/Y6ADJVB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06444&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6ADJVB55FNVJCXO4IOBUQABMG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6ADJVB55FNVJCXO4IOBUQABMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG/action/storage_attestation","attest_author":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG/action/author_attestation","sign_citation":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG/action/citation_signature","submit_replication":"https://pith.science/pith/Y6ADJVB55FNVJCXO4IOBUQABMG/action/replication_record"}},"created_at":"2026-05-18T00:50:14.124219+00:00","updated_at":"2026-05-18T00:50:14.124219+00:00"}