{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7SS4SXSGUVPQUHMC43JC2XMRSD","short_pith_number":"pith:7SS4SXSG","schema_version":"1.0","canonical_sha256":"fca5c95e46a55f0a1d82e6d22d5d9190fb5ae5a6aca940a463f7cb4a1c3f01e8","source":{"kind":"arxiv","id":"1807.06719","version":1},"attestation_state":"computed","paper":{"title":"Deterministic oblivious distribution (and tight compaction) in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Enoch Peserico","submitted_at":"2018-07-18T00:40:26Z","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),"},"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":"1807.06719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T00:40:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"af6de82b93796daf8a15fbfd9b58a2638066b9eb8e5b925e20dff5f1bc5a530b","abstract_canon_sha256":"84045aa20762f44d985875b456af44ff965487a61ef21fa3e1d6e2974b305787"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:26.035115Z","signature_b64":"1yMWvKSgFISsZfndOge6+4pL73kipujxOA87uvGjwVqghH+wyNuDICxCzEreMm7HsNCI0q+Rcv6JlgpcaYJADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca5c95e46a55f0a1d82e6d22d5d9190fb5ae5a6aca940a463f7cb4a1c3f01e8","last_reissued_at":"2026-05-18T00:10:26.034567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:26.034567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic oblivious distribution (and tight compaction) in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Enoch Peserico","submitted_at":"2018-07-18T00:40:26Z","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),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06719","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":"1807.06719","created_at":"2026-05-18T00:10:26.034666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06719v1","created_at":"2026-05-18T00:10:26.034666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06719","created_at":"2026-05-18T00:10:26.034666+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SS4SXSGUVPQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SS4SXSGUVPQUHMC","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SS4SXSG","created_at":"2026-05-18T12:32:11.075285+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/7SS4SXSGUVPQUHMC43JC2XMRSD","json":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD.json","graph_json":"https://pith.science/api/pith-number/7SS4SXSGUVPQUHMC43JC2XMRSD/graph.json","events_json":"https://pith.science/api/pith-number/7SS4SXSGUVPQUHMC43JC2XMRSD/events.json","paper":"https://pith.science/paper/7SS4SXSG"},"agent_actions":{"view_html":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD","download_json":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD.json","view_paper":"https://pith.science/paper/7SS4SXSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06719&json=true","fetch_graph":"https://pith.science/api/pith-number/7SS4SXSGUVPQUHMC43JC2XMRSD/graph.json","fetch_events":"https://pith.science/api/pith-number/7SS4SXSGUVPQUHMC43JC2XMRSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD/action/storage_attestation","attest_author":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD/action/author_attestation","sign_citation":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD/action/citation_signature","submit_replication":"https://pith.science/pith/7SS4SXSGUVPQUHMC43JC2XMRSD/action/replication_record"}},"created_at":"2026-05-18T00:10:26.034666+00:00","updated_at":"2026-05-18T00:10:26.034666+00:00"}