{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QLROTQZCZU5R5EFUYUKV3S6X3I","short_pith_number":"pith:QLROTQZC","canonical_record":{"source":{"id":"1208.3663","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-17T19:39:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b91d7fa59522108b8c68a5f21d3842df8995eaff343e634486df6a66c4ac5236","abstract_canon_sha256":"aa3a073398813eb9f9289e7447f5ec11173feff4080dd7e9ad842d4355c7a8ba"},"schema_version":"1.0"},"canonical_sha256":"82e2e9c322cd3b1e90b4c5155dcbd7da31666d8fe9a3cb15496a578168f595f1","source":{"kind":"arxiv","id":"1208.3663","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3663","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3663v5","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3663","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"QLROTQZCZU5R","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QLROTQZCZU5R5EFU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QLROTQZC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QLROTQZCZU5R5EFUYUKV3S6X3I","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3663","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-17T19:39:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b91d7fa59522108b8c68a5f21d3842df8995eaff343e634486df6a66c4ac5236","abstract_canon_sha256":"aa3a073398813eb9f9289e7447f5ec11173feff4080dd7e9ad842d4355c7a8ba"},"schema_version":"1.0"},"canonical_sha256":"82e2e9c322cd3b1e90b4c5155dcbd7da31666d8fe9a3cb15496a578168f595f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:03.439848Z","signature_b64":"ubgMNQ0cQo3HoQdohbWEKqoAcEn18HOLVuKLvMFVS2CuWYYYEdKbNikJNL3q0whnDXDbdHxfEU4DqV7DSgzyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e2e9c322cd3b1e90b4c5155dcbd7da31666d8fe9a3cb15496a578168f595f1","last_reissued_at":"2026-05-18T02:49:03.439408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:03.439408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3663","source_version":5,"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GO4xXSsLrbAGgITwHQCCiTDThhPVKEhnYWVpfXG9zHvRYjTEGGyVyonguC5AaOjzpdKdFko2klsooyhu7JocAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:38:45.311643Z"},"content_sha256":"43d945c20e48ba9d951da09e1ea41559063941b81cd3b8a3c18d0c786b4cdb63","schema_version":"1.0","event_id":"sha256:43d945c20e48ba9d951da09e1ea41559063941b81cd3b8a3c18d0c786b4cdb63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QLROTQZCZU5R5EFUYUKV3S6X3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Time Trade-offs for Stack-Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Kunikiko Sadakane, Luis Barba, Matias Korman, Rodrigo Silveira, Stefan Langerman","submitted_at":"2012-08-17T19:39:34Z","abstract_excerpt":"In memory-constrained algorithms we have read-only access to the input, and the number of additional variables is limited. In this paper we introduce the compressed stack technique, a method that allows to transform algorithms whose space bottleneck is a stack into memory-constrained algorithms. Given an algorithm \\alg\\ that runs in O(n) time using $\\Theta(n)$ variables, we can modify it so that it runs in $O(n^2/s)$ time using a workspace of O(s) variables (for any $s\\in o(\\log n)$) or $O(n\\log n/\\log p)$ time using $O(p\\log n/\\log p)$ variables (for any $2\\leq p\\leq n$). We also show how the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3663","kind":"arxiv","version":5},"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ue20azMtFmT53alSj4jki8/uUlKCJXX/xbSTGh1DyNUzHzEhs8mnaZkFQJXYDAOL3Oiz7EJJkXBeu+p2x07Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:38:45.312310Z"},"content_sha256":"0d01708440f50e1c5dc3a25fcc43f677725ea2910afa4bed44b698e502007d4a","schema_version":"1.0","event_id":"sha256:0d01708440f50e1c5dc3a25fcc43f677725ea2910afa4bed44b698e502007d4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLROTQZCZU5R5EFUYUKV3S6X3I/bundle.json","state_url":"https://pith.science/pith/QLROTQZCZU5R5EFUYUKV3S6X3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLROTQZCZU5R5EFUYUKV3S6X3I/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-05-27T07:38:45Z","links":{"resolver":"https://pith.science/pith/QLROTQZCZU5R5EFUYUKV3S6X3I","bundle":"https://pith.science/pith/QLROTQZCZU5R5EFUYUKV3S6X3I/bundle.json","state":"https://pith.science/pith/QLROTQZCZU5R5EFUYUKV3S6X3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLROTQZCZU5R5EFUYUKV3S6X3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QLROTQZCZU5R5EFUYUKV3S6X3I","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":"aa3a073398813eb9f9289e7447f5ec11173feff4080dd7e9ad842d4355c7a8ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-17T19:39:34Z","title_canon_sha256":"b91d7fa59522108b8c68a5f21d3842df8995eaff343e634486df6a66c4ac5236"},"schema_version":"1.0","source":{"id":"1208.3663","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3663","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3663v5","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3663","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"QLROTQZCZU5R","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QLROTQZCZU5R5EFU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QLROTQZC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:0d01708440f50e1c5dc3a25fcc43f677725ea2910afa4bed44b698e502007d4a","target":"graph","created_at":"2026-05-18T02:49:03Z","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":"In memory-constrained algorithms we have read-only access to the input, and the number of additional variables is limited. In this paper we introduce the compressed stack technique, a method that allows to transform algorithms whose space bottleneck is a stack into memory-constrained algorithms. Given an algorithm \\alg\\ that runs in O(n) time using $\\Theta(n)$ variables, we can modify it so that it runs in $O(n^2/s)$ time using a workspace of O(s) variables (for any $s\\in o(\\log n)$) or $O(n\\log n/\\log p)$ time using $O(p\\log n/\\log p)$ variables (for any $2\\leq p\\leq n$). We also show how the","authors_text":"Kunikiko Sadakane, Luis Barba, Matias Korman, Rodrigo Silveira, Stefan Langerman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-17T19:39:34Z","title":"Space-Time Trade-offs for Stack-Based Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3663","kind":"arxiv","version":5},"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:43d945c20e48ba9d951da09e1ea41559063941b81cd3b8a3c18d0c786b4cdb63","target":"record","created_at":"2026-05-18T02:49:03Z","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":"aa3a073398813eb9f9289e7447f5ec11173feff4080dd7e9ad842d4355c7a8ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-17T19:39:34Z","title_canon_sha256":"b91d7fa59522108b8c68a5f21d3842df8995eaff343e634486df6a66c4ac5236"},"schema_version":"1.0","source":{"id":"1208.3663","kind":"arxiv","version":5}},"canonical_sha256":"82e2e9c322cd3b1e90b4c5155dcbd7da31666d8fe9a3cb15496a578168f595f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82e2e9c322cd3b1e90b4c5155dcbd7da31666d8fe9a3cb15496a578168f595f1","first_computed_at":"2026-05-18T02:49:03.439408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:03.439408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubgMNQ0cQo3HoQdohbWEKqoAcEn18HOLVuKLvMFVS2CuWYYYEdKbNikJNL3q0whnDXDbdHxfEU4DqV7DSgzyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:03.439848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3663","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43d945c20e48ba9d951da09e1ea41559063941b81cd3b8a3c18d0c786b4cdb63","sha256:0d01708440f50e1c5dc3a25fcc43f677725ea2910afa4bed44b698e502007d4a"],"state_sha256":"8b1bec5f930bb4fc4672b0e6bd6750afc44ed034204280715342bac116451beb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIkDwHMRjUSl2fjvYMUAoTK+AjY1TTnaYfmjDHOHjkLdS1/LU+T6jgCo/dSxB+mCwMwwS2gz03wZtjyl/gVuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:38:45.315689Z","bundle_sha256":"e50d2a7edb1f92ac4b1ceb050a01ce4076132a503f850f6239405cbe45d6c765"}}