{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UX7QFK47PNLRBUOTFHGUHMEVYI","short_pith_number":"pith:UX7QFK47","schema_version":"1.0","canonical_sha256":"a5ff02ab9f7b5710d1d329cd43b095c2187cbc9e5f592f44fe9da4fabbf0c236","source":{"kind":"arxiv","id":"1504.06501","version":1},"attestation_state":"computed","paper":{"title":"Run Generation Revisited: What Goes Up May or May Not Come Down","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"(2) University of Massachusetts, Amherst), Andrew McGregor (2), Hoa T. Vu (2) ((1) Stony Brook University, Michael A. Bender (1), Samuel McCauley (1), Shikha Singh (1)","submitted_at":"2015-04-24T13:36:47Z","abstract_excerpt":"In this paper, we revisit the classic problem of run generation. Run generation is the first phase of external-memory sorting, where the objective is to scan through the data, reorder elements using a small buffer of size M , and output runs (contiguously sorted chunks of elements) that are as long as possible.\n  We develop algorithms for minimizing the total number of runs (or equivalently, maximizing the average run length) when the runs are allowed to be sorted or reverse sorted. We study the problem in the online setting, both with and without resource augmentation, and in the offline sett"},"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":"1504.06501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T13:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"0ea2d1021c62a5f7e6a7db284c27b486a2bdc9428c57fdfc6c9ee829e94713be","abstract_canon_sha256":"c7dd71c3eec94f4b4260351b7885a308a91e69beeb4f5d94f7c2df79ca1c76ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:53.468193Z","signature_b64":"ptoC4N0HG1Wmq6tVqkXGLkUiOK5clFNKNXWcJokTnWn6bPN9Qj7ipD3X1XnOKI/iPJNDiwBzrN1Ro/3VOqgTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ff02ab9f7b5710d1d329cd43b095c2187cbc9e5f592f44fe9da4fabbf0c236","last_reissued_at":"2026-05-18T02:17:53.467566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:53.467566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Run Generation Revisited: What Goes Up May or May Not Come Down","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"(2) University of Massachusetts, Amherst), Andrew McGregor (2), Hoa T. Vu (2) ((1) Stony Brook University, Michael A. Bender (1), Samuel McCauley (1), Shikha Singh (1)","submitted_at":"2015-04-24T13:36:47Z","abstract_excerpt":"In this paper, we revisit the classic problem of run generation. Run generation is the first phase of external-memory sorting, where the objective is to scan through the data, reorder elements using a small buffer of size M , and output runs (contiguously sorted chunks of elements) that are as long as possible.\n  We develop algorithms for minimizing the total number of runs (or equivalently, maximizing the average run length) when the runs are allowed to be sorted or reverse sorted. We study the problem in the online setting, both with and without resource augmentation, and in the offline sett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06501","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":"1504.06501","created_at":"2026-05-18T02:17:53.467685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06501v1","created_at":"2026-05-18T02:17:53.467685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06501","created_at":"2026-05-18T02:17:53.467685+00:00"},{"alias_kind":"pith_short_12","alias_value":"UX7QFK47PNLR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UX7QFK47PNLRBUOT","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UX7QFK47","created_at":"2026-05-18T12:29:44.643036+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/UX7QFK47PNLRBUOTFHGUHMEVYI","json":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI.json","graph_json":"https://pith.science/api/pith-number/UX7QFK47PNLRBUOTFHGUHMEVYI/graph.json","events_json":"https://pith.science/api/pith-number/UX7QFK47PNLRBUOTFHGUHMEVYI/events.json","paper":"https://pith.science/paper/UX7QFK47"},"agent_actions":{"view_html":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI","download_json":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI.json","view_paper":"https://pith.science/paper/UX7QFK47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06501&json=true","fetch_graph":"https://pith.science/api/pith-number/UX7QFK47PNLRBUOTFHGUHMEVYI/graph.json","fetch_events":"https://pith.science/api/pith-number/UX7QFK47PNLRBUOTFHGUHMEVYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI/action/storage_attestation","attest_author":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI/action/author_attestation","sign_citation":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI/action/citation_signature","submit_replication":"https://pith.science/pith/UX7QFK47PNLRBUOTFHGUHMEVYI/action/replication_record"}},"created_at":"2026-05-18T02:17:53.467685+00:00","updated_at":"2026-05-18T02:17:53.467685+00:00"}