{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MIZSAMMXKZGW6HV5YJEGNVBSN4","short_pith_number":"pith:MIZSAMMX","canonical_record":{"source":{"id":"1709.10477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T16:13:52Z","cross_cats_sorted":[],"title_canon_sha256":"82d6d6d55c7068e0d33bb1a859d623778c804d1016f5c5e592eb7f0e245020cc","abstract_canon_sha256":"1ee94539e2d03d109dd3f61e4b46ad2a76f1c4082788aced564692472d024229"},"schema_version":"1.0"},"canonical_sha256":"6233203197564d6f1ebdc24866d4326f0ff16f46ba1d4ad92fd78c6bdd071908","source":{"kind":"arxiv","id":"1709.10477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10477","created_at":"2026-05-18T00:34:01Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10477v1","created_at":"2026-05-18T00:34:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10477","created_at":"2026-05-18T00:34:01Z"},{"alias_kind":"pith_short_12","alias_value":"MIZSAMMXKZGW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MIZSAMMXKZGW6HV5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MIZSAMMX","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MIZSAMMXKZGW6HV5YJEGNVBSN4","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T16:13:52Z","cross_cats_sorted":[],"title_canon_sha256":"82d6d6d55c7068e0d33bb1a859d623778c804d1016f5c5e592eb7f0e245020cc","abstract_canon_sha256":"1ee94539e2d03d109dd3f61e4b46ad2a76f1c4082788aced564692472d024229"},"schema_version":"1.0"},"canonical_sha256":"6233203197564d6f1ebdc24866d4326f0ff16f46ba1d4ad92fd78c6bdd071908","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:01.007608Z","signature_b64":"xE/vYnoaydtqvdVQGYyBBAISNcTcNrIOpVprntMh6MI+ic0bjOGtqbkcJUC+2PybDVVIf3a8JhiMWMDZ1JU/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6233203197564d6f1ebdc24866d4326f0ff16f46ba1d4ad92fd78c6bdd071908","last_reissued_at":"2026-05-18T00:34:01.007146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:01.007146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10477","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-18T00:34:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bx1EJpvFdJdQ9I5YSdUoCBulUmIjQHRdKbnjtsjB9QksEduHgbNe14JWjGc/4dX/vma1q482Jp3i7BT/Tad9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:27:19.793992Z"},"content_sha256":"8f475039c7d75260815f59870731fdc36e374009c9afe1464c889acaf2ed6cd3","schema_version":"1.0","event_id":"sha256:8f475039c7d75260815f59870731fdc36e374009c9afe1464c889acaf2ed6cd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MIZSAMMXKZGW6HV5YJEGNVBSN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On-the-Fly Array Initialization in Less Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Kammer, Torben Hagerup","submitted_at":"2017-09-29T16:13:52Z","abstract_excerpt":"We show that for all given $n,t,w \\in \\{1,2,...\\}$ with $n<2^w$, an array of $n$ entries of $w$ bits each can be represented on a word RAM with a word length of $w$ bits in at most $nw+\\lceil n(t/(2 w))^t\\rceil$ bits of uninitialized memory to support constant-time initialization of the whole array and $O(t)$-time reading and writing of individual array entries. At one end of this tradeoff, we achieve initialization and access (i.e., reading and writing) in constant time with $nw+\\lceil n/w^t\\rceil$ bits for arbitrary fixed $t$, to be compared with $nw+\\Theta(n)$ bits for the best previous sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10477","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-18T00:34:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEqlE2ohs8cvEsq8PAAwi2mMpvZwGyGVVqJ2BhSs/YN8RP0vsVCpUnJnhR9Wn5vhQHDBadODNOb9UF+D7qnzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:27:19.794641Z"},"content_sha256":"06f55f50435bb0b0427402980a59dab82325596937a7ac5481b72e541f5d0d50","schema_version":"1.0","event_id":"sha256:06f55f50435bb0b0427402980a59dab82325596937a7ac5481b72e541f5d0d50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4/bundle.json","state_url":"https://pith.science/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4/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-06T19:27:19Z","links":{"resolver":"https://pith.science/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4","bundle":"https://pith.science/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4/bundle.json","state":"https://pith.science/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIZSAMMXKZGW6HV5YJEGNVBSN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MIZSAMMXKZGW6HV5YJEGNVBSN4","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":"1ee94539e2d03d109dd3f61e4b46ad2a76f1c4082788aced564692472d024229","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T16:13:52Z","title_canon_sha256":"82d6d6d55c7068e0d33bb1a859d623778c804d1016f5c5e592eb7f0e245020cc"},"schema_version":"1.0","source":{"id":"1709.10477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10477","created_at":"2026-05-18T00:34:01Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10477v1","created_at":"2026-05-18T00:34:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10477","created_at":"2026-05-18T00:34:01Z"},{"alias_kind":"pith_short_12","alias_value":"MIZSAMMXKZGW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MIZSAMMXKZGW6HV5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MIZSAMMX","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:06f55f50435bb0b0427402980a59dab82325596937a7ac5481b72e541f5d0d50","target":"graph","created_at":"2026-05-18T00:34:01Z","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 show that for all given $n,t,w \\in \\{1,2,...\\}$ with $n<2^w$, an array of $n$ entries of $w$ bits each can be represented on a word RAM with a word length of $w$ bits in at most $nw+\\lceil n(t/(2 w))^t\\rceil$ bits of uninitialized memory to support constant-time initialization of the whole array and $O(t)$-time reading and writing of individual array entries. At one end of this tradeoff, we achieve initialization and access (i.e., reading and writing) in constant time with $nw+\\lceil n/w^t\\rceil$ bits for arbitrary fixed $t$, to be compared with $nw+\\Theta(n)$ bits for the best previous sol","authors_text":"Frank Kammer, Torben Hagerup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T16:13:52Z","title":"On-the-Fly Array Initialization in Less Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10477","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:8f475039c7d75260815f59870731fdc36e374009c9afe1464c889acaf2ed6cd3","target":"record","created_at":"2026-05-18T00:34:01Z","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":"1ee94539e2d03d109dd3f61e4b46ad2a76f1c4082788aced564692472d024229","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T16:13:52Z","title_canon_sha256":"82d6d6d55c7068e0d33bb1a859d623778c804d1016f5c5e592eb7f0e245020cc"},"schema_version":"1.0","source":{"id":"1709.10477","kind":"arxiv","version":1}},"canonical_sha256":"6233203197564d6f1ebdc24866d4326f0ff16f46ba1d4ad92fd78c6bdd071908","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6233203197564d6f1ebdc24866d4326f0ff16f46ba1d4ad92fd78c6bdd071908","first_computed_at":"2026-05-18T00:34:01.007146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:01.007146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xE/vYnoaydtqvdVQGYyBBAISNcTcNrIOpVprntMh6MI+ic0bjOGtqbkcJUC+2PybDVVIf3a8JhiMWMDZ1JU/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:01.007608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f475039c7d75260815f59870731fdc36e374009c9afe1464c889acaf2ed6cd3","sha256:06f55f50435bb0b0427402980a59dab82325596937a7ac5481b72e541f5d0d50"],"state_sha256":"783b6edbddeb42f4e8362204dd983490e6786baf289032282226e1b92a077191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4K5Z2gYuj++EO7LjIYxkNMrjvYMne86o47dVf3v9/TfqH0kyqXmQ0E0xUeTBUui8OozGlyMxwV/s1LGLGXrLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:27:19.798385Z","bundle_sha256":"9c303be36acc40432197c144fff5f0f6f33d0db38f5def5923d80963edbdf366"}}