{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:U3XNVK2MPNM2U3YU5ELKVCRNMA","short_pith_number":"pith:U3XNVK2M","canonical_record":{"source":{"id":"1204.6508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-29T19:31:01Z","cross_cats_sorted":["cs.CG","cs.DC"],"title_canon_sha256":"42b9fbed6c8088bd583dcf1e5e8693119b5dbc7fa45f00127ea024695c959dfd","abstract_canon_sha256":"d0427f85b37fa519a33c53e9d28efa0c9eaf0befded8fb8fb1b2ab18ddd1c553"},"schema_version":"1.0"},"canonical_sha256":"a6eedaab4c7b59aa6f14e916aa8a2d602b4b0d9c5f08188a045a0e60371d8a60","source":{"kind":"arxiv","id":"1204.6508","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6508","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6508v2","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6508","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"U3XNVK2MPNM2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U3XNVK2MPNM2U3YU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U3XNVK2M","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:U3XNVK2MPNM2U3YU5ELKVCRNMA","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-29T19:31:01Z","cross_cats_sorted":["cs.CG","cs.DC"],"title_canon_sha256":"42b9fbed6c8088bd583dcf1e5e8693119b5dbc7fa45f00127ea024695c959dfd","abstract_canon_sha256":"d0427f85b37fa519a33c53e9d28efa0c9eaf0befded8fb8fb1b2ab18ddd1c553"},"schema_version":"1.0"},"canonical_sha256":"a6eedaab4c7b59aa6f14e916aa8a2d602b4b0d9c5f08188a045a0e60371d8a60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:48.917752Z","signature_b64":"Eg9W4oke5bNs6InoHJAWxQf9lTnMmxgsgNusyD1amLqkN2E1goDzt1XB5htG9PmncUwnWu0qhfR7a3hfoilUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6eedaab4c7b59aa6f14e916aa8a2d602b4b0d9c5f08188a045a0e60371d8a60","last_reissued_at":"2026-05-18T03:54:48.917308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:48.917308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6508","source_version":2,"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-18T03:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tjYnIllhuIbF/1kgPFaDyO9j1Md+Dchvo6TwJRwIoZMPqhEvs2waGV1LeoTl6M2iYZCIoKBCrAffZWGK7u0vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:54:35.329023Z"},"content_sha256":"8b14c17ec9f6fc6085e0d3256bbc3ac693c8174fff75b5db80ba462bc482a223","schema_version":"1.0","event_id":"sha256:8b14c17ec9f6fc6085e0d3256bbc3ac693c8174fff75b5db80ba462bc482a223"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:U3XNVK2MPNM2U3YU5ELKVCRNMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DC"],"primary_cat":"cs.DS","authors_text":"Neeraj Sharma, Sandeep Sen","submitted_at":"2012-04-29T19:31:01Z","abstract_excerpt":"In this paper we present randomized algorithms for sorting and convex hull that achieves optimal performance (for speed-up and cache misses) on the multicore model with private cache model. Our algorithms are cache oblivious and generalize the randomized divide and conquer strategy given by Reischuk and Reif and Sen. Although the approach yielded optimal speed-up in the PRAM model, we require additional techniques to optimize cache-misses in an oblivious setting. Under a mild assumption on input and number of processors our algorithm will have optimal time and cache misses with high probabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6508","kind":"arxiv","version":2},"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-18T03:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVTfZrFJh6Rp2ntFgugBSNK9wwp9oi4hNQn1Dr3ofcmqrCXVYRhml/+2GflC+eojZYtdnBs3lTdSuyj6TR3tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:54:35.329380Z"},"content_sha256":"2d82d89c64c074935f835eccb8bf08d44ddb49187cb17137fb401197a86ccdde","schema_version":"1.0","event_id":"sha256:2d82d89c64c074935f835eccb8bf08d44ddb49187cb17137fb401197a86ccdde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA/bundle.json","state_url":"https://pith.science/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA/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-03T02:54:35Z","links":{"resolver":"https://pith.science/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA","bundle":"https://pith.science/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA/bundle.json","state":"https://pith.science/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3XNVK2MPNM2U3YU5ELKVCRNMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U3XNVK2MPNM2U3YU5ELKVCRNMA","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":"d0427f85b37fa519a33c53e9d28efa0c9eaf0befded8fb8fb1b2ab18ddd1c553","cross_cats_sorted":["cs.CG","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-29T19:31:01Z","title_canon_sha256":"42b9fbed6c8088bd583dcf1e5e8693119b5dbc7fa45f00127ea024695c959dfd"},"schema_version":"1.0","source":{"id":"1204.6508","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6508","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6508v2","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6508","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"U3XNVK2MPNM2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U3XNVK2MPNM2U3YU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U3XNVK2M","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:2d82d89c64c074935f835eccb8bf08d44ddb49187cb17137fb401197a86ccdde","target":"graph","created_at":"2026-05-18T03:54:48Z","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 this paper we present randomized algorithms for sorting and convex hull that achieves optimal performance (for speed-up and cache misses) on the multicore model with private cache model. Our algorithms are cache oblivious and generalize the randomized divide and conquer strategy given by Reischuk and Reif and Sen. Although the approach yielded optimal speed-up in the PRAM model, we require additional techniques to optimize cache-misses in an oblivious setting. Under a mild assumption on input and number of processors our algorithm will have optimal time and cache misses with high probabilit","authors_text":"Neeraj Sharma, Sandeep Sen","cross_cats":["cs.CG","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-29T19:31:01Z","title":"Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6508","kind":"arxiv","version":2},"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:8b14c17ec9f6fc6085e0d3256bbc3ac693c8174fff75b5db80ba462bc482a223","target":"record","created_at":"2026-05-18T03:54:48Z","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":"d0427f85b37fa519a33c53e9d28efa0c9eaf0befded8fb8fb1b2ab18ddd1c553","cross_cats_sorted":["cs.CG","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-29T19:31:01Z","title_canon_sha256":"42b9fbed6c8088bd583dcf1e5e8693119b5dbc7fa45f00127ea024695c959dfd"},"schema_version":"1.0","source":{"id":"1204.6508","kind":"arxiv","version":2}},"canonical_sha256":"a6eedaab4c7b59aa6f14e916aa8a2d602b4b0d9c5f08188a045a0e60371d8a60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6eedaab4c7b59aa6f14e916aa8a2d602b4b0d9c5f08188a045a0e60371d8a60","first_computed_at":"2026-05-18T03:54:48.917308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:48.917308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eg9W4oke5bNs6InoHJAWxQf9lTnMmxgsgNusyD1amLqkN2E1goDzt1XB5htG9PmncUwnWu0qhfR7a3hfoilUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:48.917752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6508","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b14c17ec9f6fc6085e0d3256bbc3ac693c8174fff75b5db80ba462bc482a223","sha256:2d82d89c64c074935f835eccb8bf08d44ddb49187cb17137fb401197a86ccdde"],"state_sha256":"1e4061b7e41018f12410bb8cfb8b5647781c0b91daabd926fe92172fef28d4ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kd31N00RAUlp0IFYNrLNb0ohfEpyxK0BShByI6rw7nvZFppMNTmD2WVzjQMRe5BFysX2D6SmAXUmO+5HaCmBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:54:35.331247Z","bundle_sha256":"b2e06012b8df29e01cee549a6fa86128b9e86c310db0b546ba530216f9fd6d35"}}