{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TLCHVSNXTU6X4TLWXAIFNHI66F","short_pith_number":"pith:TLCHVSNX","schema_version":"1.0","canonical_sha256":"9ac47ac9b79d3d7e4d76b810569d1ef14ccc8775cb0ce6ebb805dc3987807145","source":{"kind":"arxiv","id":"1606.04669","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.04669","created_at":"2026-05-18T00:53:02.483200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04669v2","created_at":"2026-05-18T00:53:02.483200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04669","created_at":"2026-05-18T00:53:02.483200+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLCHVSNXTU6X","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLCHVSNXTU6X4TLW","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLCHVSNX","created_at":"2026-05-18T12:30:44.179134+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/TLCHVSNXTU6X4TLWXAIFNHI66F","json":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F.json","graph_json":"https://pith.science/api/pith-number/TLCHVSNXTU6X4TLWXAIFNHI66F/graph.json","events_json":"https://pith.science/api/pith-number/TLCHVSNXTU6X4TLWXAIFNHI66F/events.json","paper":"https://pith.science/paper/TLCHVSNX"},"agent_actions":{"view_html":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F","download_json":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F.json","view_paper":"https://pith.science/paper/TLCHVSNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04669&json=true","fetch_graph":"https://pith.science/api/pith-number/TLCHVSNXTU6X4TLWXAIFNHI66F/graph.json","fetch_events":"https://pith.science/api/pith-number/TLCHVSNXTU6X4TLWXAIFNHI66F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/action/storage_attestation","attest_author":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/action/author_attestation","sign_citation":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/action/citation_signature","submit_replication":"https://pith.science/pith/TLCHVSNXTU6X4TLWXAIFNHI66F/action/replication_record"}},"created_at":"2026-05-18T00:53:02.483200+00:00","updated_at":"2026-05-18T00:53:02.483200+00:00"}