{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FK7SO7DP4FTWZFQAYIF3QXMAX4","short_pith_number":"pith:FK7SO7DP","schema_version":"1.0","canonical_sha256":"2abf277c6fe1676c9600c20bb85d80bf2912396993ce8238f8f215173a507876","source":{"kind":"arxiv","id":"1812.05306","version":1},"attestation_state":"computed","paper":{"title":"Optimal Algorithm for Profiling Dynamic Arrays with Finite Values","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Dingcheng Yang, Junhui Deng, Shenghua Liu, Wenjian Yu","submitted_at":"2018-12-13T08:04:09Z","abstract_excerpt":"How can one quickly answer the most and top popular objects at any time, given a large log stream in a system of billions of users? It is equivalent to find the mode and top-frequent elements in a dynamic array corresponding to the log stream. However, most existing work either restrain the dynamic array within a sliding window, or do not take advantages of only one element can be added or removed in a log stream. Therefore, we propose a profiling algorithm, named S-Profile, which is of $O(1)$ time complexity for every updating of the dynamic array, and optimal in terms of computational comple"},"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":"1812.05306","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T08:04:09Z","cross_cats_sorted":["cs.CC","cs.SI"],"title_canon_sha256":"68ea418f8c2ad3d618ac52b28ac98b4eff73f2a26d0d97bbaf82989ac4c5f330","abstract_canon_sha256":"ccd8ec2dd819e655ef32afacdf7961376418beb21e471253018832b64b005992"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:23.866082Z","signature_b64":"Cia3E8ZaUMfAf7dBaxgcpNit7VhH/qo1NP/AmeunfDS0RhewBeLI+E4JEAfkBEYAH/TWc32DRxJ4ajdncXMfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2abf277c6fe1676c9600c20bb85d80bf2912396993ce8238f8f215173a507876","last_reissued_at":"2026-05-17T23:58:23.865544Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:23.865544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Algorithm for Profiling Dynamic Arrays with Finite Values","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Dingcheng Yang, Junhui Deng, Shenghua Liu, Wenjian Yu","submitted_at":"2018-12-13T08:04:09Z","abstract_excerpt":"How can one quickly answer the most and top popular objects at any time, given a large log stream in a system of billions of users? It is equivalent to find the mode and top-frequent elements in a dynamic array corresponding to the log stream. However, most existing work either restrain the dynamic array within a sliding window, or do not take advantages of only one element can be added or removed in a log stream. Therefore, we propose a profiling algorithm, named S-Profile, which is of $O(1)$ time complexity for every updating of the dynamic array, and optimal in terms of computational comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05306","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":"1812.05306","created_at":"2026-05-17T23:58:23.865633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05306v1","created_at":"2026-05-17T23:58:23.865633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05306","created_at":"2026-05-17T23:58:23.865633+00:00"},{"alias_kind":"pith_short_12","alias_value":"FK7SO7DP4FTW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FK7SO7DP4FTWZFQA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FK7SO7DP","created_at":"2026-05-18T12:32:22.470017+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/FK7SO7DP4FTWZFQAYIF3QXMAX4","json":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4.json","graph_json":"https://pith.science/api/pith-number/FK7SO7DP4FTWZFQAYIF3QXMAX4/graph.json","events_json":"https://pith.science/api/pith-number/FK7SO7DP4FTWZFQAYIF3QXMAX4/events.json","paper":"https://pith.science/paper/FK7SO7DP"},"agent_actions":{"view_html":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4","download_json":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4.json","view_paper":"https://pith.science/paper/FK7SO7DP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05306&json=true","fetch_graph":"https://pith.science/api/pith-number/FK7SO7DP4FTWZFQAYIF3QXMAX4/graph.json","fetch_events":"https://pith.science/api/pith-number/FK7SO7DP4FTWZFQAYIF3QXMAX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/action/storage_attestation","attest_author":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/action/author_attestation","sign_citation":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/action/citation_signature","submit_replication":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/action/replication_record"}},"created_at":"2026-05-17T23:58:23.865633+00:00","updated_at":"2026-05-17T23:58:23.865633+00:00"}