{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TLCHVSNXTU6X4TLWXAIFNHI66F","short_pith_number":"pith:TLCHVSNX","canonical_record":{"source":{"id":"1606.04669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-15T08:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"d1f056abab2e8852dd88adc56761638f7232ca6e6e5434dafc64def7629dd90a","abstract_canon_sha256":"a8def3091674c18278f1b346af1b14a7a103d1060168f48cb8b52240db0d670c"},"schema_version":"1.0"},"canonical_sha256":"9ac47ac9b79d3d7e4d76b810569d1ef14ccc8775cb0ce6ebb805dc3987807145","source":{"kind":"arxiv","id":"1606.04669","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04669","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04669v2","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04669","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"TLCHVSNXTU6X","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TLCHVSNXTU6X4TLW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TLCHVSNX","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TLCHVSNXTU6X4TLWXAIFNHI66F","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-15T08:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"d1f056abab2e8852dd88adc56761638f7232ca6e6e5434dafc64def7629dd90a","abstract_canon_sha256":"a8def3091674c18278f1b346af1b14a7a103d1060168f48cb8b52240db0d670c"},"schema_version":"1.0"},"canonical_sha256":"9ac47ac9b79d3d7e4d76b810569d1ef14ccc8775cb0ce6ebb805dc3987807145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:02.483594Z","signature_b64":"uTYoTAtZ77kzcu4VZ63Eg4PasIM8b/0gxUUvgLtHohYDniiAUyNiSeTnPmJnoDKHpEIeRhcEMoTUKOPg0LoeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ac47ac9b79d3d7e4d76b810569d1ef14ccc8775cb0ce6ebb805dc3987807145","last_reissued_at":"2026-05-18T00:53:02.483133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:02.483133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04669","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-18T00:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WlKXLPd+Hox/LXC7BSRZaal61ZmUukq/My42wi+YvJKvxbAxmWU1O/AZ7QqeFK0mJnRMKgzSci6/anHzudhNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:09:43.781393Z"},"content_sha256":"c7f1b3f1785d2b0eb086bfd3e58fb845103ec879aeac48a897ac7f2f79f0c048","schema_version":"1.0","event_id":"sha256:c7f1b3f1785d2b0eb086bfd3e58fb845103ec879aeac48a897ac7f2f79f0c048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TLCHVSNXTU6X4TLWXAIFNHI66F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Space Saving on Multi and Many-Core Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giovanni Aloisio, Italo Epicoco, Marco Pulimeno, Massimo Cafaro","submitted_at":"2016-06-15T08:16:11Z","abstract_excerpt":"Given an array $\\mathcal{A}$ of $n$ elements and a value $2 \\leq k \\leq n$, a frequent item or $k$-majority element is an element occurring in $\\mathcal{A}$ more than $n/k$ times. The $k$-majority problem requires finding all of the $k$-majority elements. In this paper we deal with parallel shared-memory algorithms for frequent items; we present a shared-memory version of the Space Saving algorithm and we study its behavior with regard to accuracy and performance on many and multi-core processors, including the Intel Phi accelerator. We also investigate a hybrid MPI/OpenMP version against a pu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04669","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-18T00:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bFDOQMN09IVzn7xHFTxVD7fNt+5NIG+XrgH7kiExlj7+gBOYy3U8CZ5oqk2w1aNBgkXx/IITcoyGbwEQrofCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:09:43.781756Z"},"content_sha256":"c972738e98d12fda3f9c6d2e8e6343a856efdc9b889b48449508cf74833b84a9","schema_version":"1.0","event_id":"sha256:c972738e98d12fda3f9c6d2e8e6343a856efdc9b889b48449508cf74833b84a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/bundle.json","state_url":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/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-04T06:09:43Z","links":{"resolver":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F","bundle":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/bundle.json","state":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TLCHVSNXTU6X4TLWXAIFNHI66F","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":"a8def3091674c18278f1b346af1b14a7a103d1060168f48cb8b52240db0d670c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-15T08:16:11Z","title_canon_sha256":"d1f056abab2e8852dd88adc56761638f7232ca6e6e5434dafc64def7629dd90a"},"schema_version":"1.0","source":{"id":"1606.04669","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04669","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04669v2","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04669","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"TLCHVSNXTU6X","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TLCHVSNXTU6X4TLW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TLCHVSNX","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:c972738e98d12fda3f9c6d2e8e6343a856efdc9b889b48449508cf74833b84a9","target":"graph","created_at":"2026-05-18T00:53:02Z","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":"Given an array $\\mathcal{A}$ of $n$ elements and a value $2 \\leq k \\leq n$, a frequent item or $k$-majority element is an element occurring in $\\mathcal{A}$ more than $n/k$ times. The $k$-majority problem requires finding all of the $k$-majority elements. In this paper we deal with parallel shared-memory algorithms for frequent items; we present a shared-memory version of the Space Saving algorithm and we study its behavior with regard to accuracy and performance on many and multi-core processors, including the Intel Phi accelerator. We also investigate a hybrid MPI/OpenMP version against a pu","authors_text":"Giovanni Aloisio, Italo Epicoco, Marco Pulimeno, Massimo Cafaro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-15T08:16:11Z","title":"Parallel Space Saving on Multi and Many-Core Processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04669","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:c7f1b3f1785d2b0eb086bfd3e58fb845103ec879aeac48a897ac7f2f79f0c048","target":"record","created_at":"2026-05-18T00:53:02Z","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":"a8def3091674c18278f1b346af1b14a7a103d1060168f48cb8b52240db0d670c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-15T08:16:11Z","title_canon_sha256":"d1f056abab2e8852dd88adc56761638f7232ca6e6e5434dafc64def7629dd90a"},"schema_version":"1.0","source":{"id":"1606.04669","kind":"arxiv","version":2}},"canonical_sha256":"9ac47ac9b79d3d7e4d76b810569d1ef14ccc8775cb0ce6ebb805dc3987807145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ac47ac9b79d3d7e4d76b810569d1ef14ccc8775cb0ce6ebb805dc3987807145","first_computed_at":"2026-05-18T00:53:02.483133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:02.483133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uTYoTAtZ77kzcu4VZ63Eg4PasIM8b/0gxUUvgLtHohYDniiAUyNiSeTnPmJnoDKHpEIeRhcEMoTUKOPg0LoeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:02.483594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04669","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7f1b3f1785d2b0eb086bfd3e58fb845103ec879aeac48a897ac7f2f79f0c048","sha256:c972738e98d12fda3f9c6d2e8e6343a856efdc9b889b48449508cf74833b84a9"],"state_sha256":"1750a23acc6807a0ef1a07fcaaae3bc744d206989d87a35ccf5be7496120f989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InDivqhazNPiw0/JB/9TCWJhLXigocCJzn97mDRDYEP+nqyCTqGagxUh+pXp2Nvhw8i/ykKmK6nSAzqKKBW3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:09:43.783741Z","bundle_sha256":"9bc5b7d9ab691ca8d74d5f496a0218c2d089c4e8b8659b850b0b5ba05074f10f"}}