{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D2MHXMZMVUGJPXPYMME736FBC7","short_pith_number":"pith:D2MHXMZM","schema_version":"1.0","canonical_sha256":"1e987bb32cad0c97ddf86309fdf8a117ff03cb46dd29bee43d854aa08a6057ee","source":{"kind":"arxiv","id":"1510.07185","version":1},"attestation_state":"computed","paper":{"title":"Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Jyrki Katajainen, Omar Darwish","submitted_at":"2015-10-24T20:56:29Z","abstract_excerpt":"We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and writes but is of limited capacity. The length of the input is $N$ elements, the length of the output is limited by the computation, and the capacity of the workspace is $O(S)$ bits for some predetermined parameter $S$. We present a state-of-the-art priority queue---called an adjustable navigation pile---for this restricted RAM model. Under s"},"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":"1510.07185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-24T20:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"c5628195e157154973d1de2b2a7ce3fe307c1c08044acb9171a5616b724055b0","abstract_canon_sha256":"283b45f36086edea917f41e82764d00b4ba6f5427ce8f828970baf5e62da6357"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:19.731353Z","signature_b64":"soHamvn3FkhENDrMhsUMUmtYlnJY6oF6nTT4CM5R9vgc3y/I5gLduSRCudhI688+0UVBL4UIJrXD45faYys0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e987bb32cad0c97ddf86309fdf8a117ff03cb46dd29bee43d854aa08a6057ee","last_reissued_at":"2026-05-18T01:29:19.730710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:19.730710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Jyrki Katajainen, Omar Darwish","submitted_at":"2015-10-24T20:56:29Z","abstract_excerpt":"We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and writes but is of limited capacity. The length of the input is $N$ elements, the length of the output is limited by the computation, and the capacity of the workspace is $O(S)$ bits for some predetermined parameter $S$. We present a state-of-the-art priority queue---called an adjustable navigation pile---for this restricted RAM model. Under s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07185","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":"1510.07185","created_at":"2026-05-18T01:29:19.730796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07185v1","created_at":"2026-05-18T01:29:19.730796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07185","created_at":"2026-05-18T01:29:19.730796+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2MHXMZMVUGJ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2MHXMZMVUGJPXPY","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2MHXMZM","created_at":"2026-05-18T12:29:17.054201+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/D2MHXMZMVUGJPXPYMME736FBC7","json":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7.json","graph_json":"https://pith.science/api/pith-number/D2MHXMZMVUGJPXPYMME736FBC7/graph.json","events_json":"https://pith.science/api/pith-number/D2MHXMZMVUGJPXPYMME736FBC7/events.json","paper":"https://pith.science/paper/D2MHXMZM"},"agent_actions":{"view_html":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7","download_json":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7.json","view_paper":"https://pith.science/paper/D2MHXMZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07185&json=true","fetch_graph":"https://pith.science/api/pith-number/D2MHXMZMVUGJPXPYMME736FBC7/graph.json","fetch_events":"https://pith.science/api/pith-number/D2MHXMZMVUGJPXPYMME736FBC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/action/storage_attestation","attest_author":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/action/author_attestation","sign_citation":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/action/citation_signature","submit_replication":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/action/replication_record"}},"created_at":"2026-05-18T01:29:19.730796+00:00","updated_at":"2026-05-18T01:29:19.730796+00:00"}