{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D2MHXMZMVUGJPXPYMME736FBC7","short_pith_number":"pith:D2MHXMZM","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"},"canonical_sha256":"1e987bb32cad0c97ddf86309fdf8a117ff03cb46dd29bee43d854aa08a6057ee","source":{"kind":"arxiv","id":"1510.07185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07185","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07185v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07185","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"D2MHXMZMVUGJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D2MHXMZMVUGJPXPY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D2MHXMZM","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D2MHXMZMVUGJPXPYMME736FBC7","target":"record","payload":{"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"},"canonical_sha256":"1e987bb32cad0c97ddf86309fdf8a117ff03cb46dd29bee43d854aa08a6057ee","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"},"source_kind":"arxiv","source_id":"1510.07185","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0wx3xOJH1J1S5ffsNzih0me8e3vnEyydy96HBIxugjfnjWzrpeCdTeagfOQ4JzKreeWnry0gfSEcFga2M0WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:41:12.020252Z"},"content_sha256":"e5c6a0c6f67a99689a69fbdf7ef15d0af55de791c18f65914488f5d62388c1a7","schema_version":"1.0","event_id":"sha256:e5c6a0c6f67a99689a69fbdf7ef15d0af55de791c18f65914488f5d62388c1a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D2MHXMZMVUGJPXPYMME736FBC7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VBTmb9722YxZvkrN4z4fZfYy6KKNualVSoh+4Ls3MiZ84gQbI1mzOGBF3r0BCoMy0kiYEmFwadKXYe41vP8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:41:12.020904Z"},"content_sha256":"f62b12fc9bbeb99dadd2394066cf6a6e2c70f23454f04b80c924d57cd2ce1e30","schema_version":"1.0","event_id":"sha256:f62b12fc9bbeb99dadd2394066cf6a6e2c70f23454f04b80c924d57cd2ce1e30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/bundle.json","state_url":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2MHXMZMVUGJPXPYMME736FBC7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T13:41:12Z","links":{"resolver":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7","bundle":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/bundle.json","state":"https://pith.science/pith/D2MHXMZMVUGJPXPYMME736FBC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2MHXMZMVUGJPXPYMME736FBC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D2MHXMZMVUGJPXPYMME736FBC7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"283b45f36086edea917f41e82764d00b4ba6f5427ce8f828970baf5e62da6357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-24T20:56:29Z","title_canon_sha256":"c5628195e157154973d1de2b2a7ce3fe307c1c08044acb9171a5616b724055b0"},"schema_version":"1.0","source":{"id":"1510.07185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07185","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07185v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07185","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"D2MHXMZMVUGJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D2MHXMZMVUGJPXPY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D2MHXMZM","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:f62b12fc9bbeb99dadd2394066cf6a6e2c70f23454f04b80c924d57cd2ce1e30","target":"graph","created_at":"2026-05-18T01:29:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amr Elmasry, Jyrki Katajainen, Omar Darwish","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-24T20:56:29Z","title":"Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07185","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5c6a0c6f67a99689a69fbdf7ef15d0af55de791c18f65914488f5d62388c1a7","target":"record","created_at":"2026-05-18T01:29:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"283b45f36086edea917f41e82764d00b4ba6f5427ce8f828970baf5e62da6357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-24T20:56:29Z","title_canon_sha256":"c5628195e157154973d1de2b2a7ce3fe307c1c08044acb9171a5616b724055b0"},"schema_version":"1.0","source":{"id":"1510.07185","kind":"arxiv","version":1}},"canonical_sha256":"1e987bb32cad0c97ddf86309fdf8a117ff03cb46dd29bee43d854aa08a6057ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e987bb32cad0c97ddf86309fdf8a117ff03cb46dd29bee43d854aa08a6057ee","first_computed_at":"2026-05-18T01:29:19.730710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:19.730710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"soHamvn3FkhENDrMhsUMUmtYlnJY6oF6nTT4CM5R9vgc3y/I5gLduSRCudhI688+0UVBL4UIJrXD45faYys0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:19.731353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5c6a0c6f67a99689a69fbdf7ef15d0af55de791c18f65914488f5d62388c1a7","sha256:f62b12fc9bbeb99dadd2394066cf6a6e2c70f23454f04b80c924d57cd2ce1e30"],"state_sha256":"ad984ccf376f08d5ab74eeba27a0d083326874d85367ec1d3351639cd6a1e99b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxWZ4UOrO8zOrRUg6r05AskkS5/21RFOLyjPA1n2gZapmKGRgemqkuHxnGxrMRAtbbNInSXlfsjcw1qzqijuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:41:12.023831Z","bundle_sha256":"01966588702256fe0f7449c9249118be1d9819826d268e80a3c3e91ba63df05a"}}