{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7SS4SXSGUVPQUHMC43JC2XMRSD","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":"84045aa20762f44d985875b456af44ff965487a61ef21fa3e1d6e2974b305787","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T00:40:26Z","title_canon_sha256":"af6de82b93796daf8a15fbfd9b58a2638066b9eb8e5b925e20dff5f1bc5a530b"},"schema_version":"1.0","source":{"id":"1807.06719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06719","created_at":"2026-05-18T00:10:26Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06719v1","created_at":"2026-05-18T00:10:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06719","created_at":"2026-05-18T00:10:26Z"},{"alias_kind":"pith_short_12","alias_value":"7SS4SXSGUVPQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7SS4SXSGUVPQUHMC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7SS4SXSG","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:3b2d0a3f9fa1593f234e8c019ecfee141d4fe90bc505b538dfa85f7bc48a513b","target":"graph","created_at":"2026-05-18T00:10:26Z","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 an array of N elements, M positions and M elements are \"marked\". We show how to permute the elements in the array so that all marked elements end in marked positions, in time O(N) (in the standard word-RAM model), deterministically, and obliviously - i.e. with a sequence of memory accesses that depends only on N and not on which elements or positions are marked.\n  As a corollary, we answer affirmatively to an open question about the existence of a deterministic oblivious algorithm with O(N) running time for tight compaction (move the M marked elements to the first M positions of the array),","authors_text":"Enoch Peserico","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T00:40:26Z","title":"Deterministic oblivious distribution (and tight compaction) in linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06719","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:99536d0df305e16a873986bcc88d4c96c148edc072567e09487f990493c1e76a","target":"record","created_at":"2026-05-18T00:10:26Z","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":"84045aa20762f44d985875b456af44ff965487a61ef21fa3e1d6e2974b305787","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T00:40:26Z","title_canon_sha256":"af6de82b93796daf8a15fbfd9b58a2638066b9eb8e5b925e20dff5f1bc5a530b"},"schema_version":"1.0","source":{"id":"1807.06719","kind":"arxiv","version":1}},"canonical_sha256":"fca5c95e46a55f0a1d82e6d22d5d9190fb5ae5a6aca940a463f7cb4a1c3f01e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fca5c95e46a55f0a1d82e6d22d5d9190fb5ae5a6aca940a463f7cb4a1c3f01e8","first_computed_at":"2026-05-18T00:10:26.034567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:26.034567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1yMWvKSgFISsZfndOge6+4pL73kipujxOA87uvGjwVqghH+wyNuDICxCzEreMm7HsNCI0q+Rcv6JlgpcaYJADg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:26.035115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99536d0df305e16a873986bcc88d4c96c148edc072567e09487f990493c1e76a","sha256:3b2d0a3f9fa1593f234e8c019ecfee141d4fe90bc505b538dfa85f7bc48a513b"],"state_sha256":"527121d0405b5e22c4b41d96ce4bb0355f01a92c4ff2304d487407acf3ecd135"}