{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FK7SO7DP4FTWZFQAYIF3QXMAX4","short_pith_number":"pith:FK7SO7DP","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"},"canonical_sha256":"2abf277c6fe1676c9600c20bb85d80bf2912396993ce8238f8f215173a507876","source":{"kind":"arxiv","id":"1812.05306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05306","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05306v1","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05306","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"FK7SO7DP4FTW","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FK7SO7DP4FTWZFQA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FK7SO7DP","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FK7SO7DP4FTWZFQAYIF3QXMAX4","target":"record","payload":{"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"},"canonical_sha256":"2abf277c6fe1676c9600c20bb85d80bf2912396993ce8238f8f215173a507876","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"},"source_kind":"arxiv","source_id":"1812.05306","source_version":1,"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-17T23:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CerbIwAW81MEMmTrDZBFjONG04XcEZPppATUeHDu0jGsPJ+0DoH7fnczHw/4ui26OQ0A6dj0a26m9vYK4t6FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:52:02.557504Z"},"content_sha256":"01fe1da5a389e0c4a83c26004dd1168bb99969b0ef69ce5c4f3565dbdd1704d8","schema_version":"1.0","event_id":"sha256:01fe1da5a389e0c4a83c26004dd1168bb99969b0ef69ce5c4f3565dbdd1704d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FK7SO7DP4FTWZFQAYIF3QXMAX4","target":"graph","payload":{"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"},"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-17T23:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlwXMf/vdvgtYtmll3u16NATnOWRoCxSMb6u2GiqvEjzvlBkUPNkv4hm6dwkNZ1LJ37fxx3O52jsmq+/G1lNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:52:02.557860Z"},"content_sha256":"db1fa4ab5e76dc86085d4ec86d5153290c52cffdcd359ff7300b227dbcf402dd","schema_version":"1.0","event_id":"sha256:db1fa4ab5e76dc86085d4ec86d5153290c52cffdcd359ff7300b227dbcf402dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/bundle.json","state_url":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/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-05-30T23:52:02Z","links":{"resolver":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4","bundle":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/bundle.json","state":"https://pith.science/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FK7SO7DP4FTWZFQAYIF3QXMAX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FK7SO7DP4FTWZFQAYIF3QXMAX4","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":"ccd8ec2dd819e655ef32afacdf7961376418beb21e471253018832b64b005992","cross_cats_sorted":["cs.CC","cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T08:04:09Z","title_canon_sha256":"68ea418f8c2ad3d618ac52b28ac98b4eff73f2a26d0d97bbaf82989ac4c5f330"},"schema_version":"1.0","source":{"id":"1812.05306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05306","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05306v1","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05306","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"FK7SO7DP4FTW","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FK7SO7DP4FTWZFQA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FK7SO7DP","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:db1fa4ab5e76dc86085d4ec86d5153290c52cffdcd359ff7300b227dbcf402dd","target":"graph","created_at":"2026-05-17T23:58:23Z","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":"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","authors_text":"Dingcheng Yang, Junhui Deng, Shenghua Liu, Wenjian Yu","cross_cats":["cs.CC","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T08:04:09Z","title":"Optimal Algorithm for Profiling Dynamic Arrays with Finite Values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05306","kind":"arxiv","version":1},"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:01fe1da5a389e0c4a83c26004dd1168bb99969b0ef69ce5c4f3565dbdd1704d8","target":"record","created_at":"2026-05-17T23:58:23Z","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":"ccd8ec2dd819e655ef32afacdf7961376418beb21e471253018832b64b005992","cross_cats_sorted":["cs.CC","cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-13T08:04:09Z","title_canon_sha256":"68ea418f8c2ad3d618ac52b28ac98b4eff73f2a26d0d97bbaf82989ac4c5f330"},"schema_version":"1.0","source":{"id":"1812.05306","kind":"arxiv","version":1}},"canonical_sha256":"2abf277c6fe1676c9600c20bb85d80bf2912396993ce8238f8f215173a507876","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2abf277c6fe1676c9600c20bb85d80bf2912396993ce8238f8f215173a507876","first_computed_at":"2026-05-17T23:58:23.865544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:23.865544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cia3E8ZaUMfAf7dBaxgcpNit7VhH/qo1NP/AmeunfDS0RhewBeLI+E4JEAfkBEYAH/TWc32DRxJ4ajdncXMfBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:23.866082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01fe1da5a389e0c4a83c26004dd1168bb99969b0ef69ce5c4f3565dbdd1704d8","sha256:db1fa4ab5e76dc86085d4ec86d5153290c52cffdcd359ff7300b227dbcf402dd"],"state_sha256":"e38646ce89be60393ea8ea1fa48d4ad74834392e54c03e8f9f66239d56a194bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OM8LjBVGjf+0fIFfUk7LUbu2cHdTHneXorEYdO8mLgUdxQex0/D8shp5jV08LO3fPq2VpmNhZ8PuB4SRC8C2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:52:02.560298Z","bundle_sha256":"2ae515b299150e8e44627558719b8020fcd31892d91ad93a4dac6d0875a6365b"}}