{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QRPIVTWEZONVHZH3Y7JDWAZFVI","short_pith_number":"pith:QRPIVTWE","schema_version":"1.0","canonical_sha256":"845e8acec4cb9b53e4fbc7d23b0325aa0388d2ed7840b8068360369430e6ba8a","source":{"kind":"arxiv","id":"1904.04994","version":1},"attestation_state":"computed","paper":{"title":"Discovering patterns of online popularity from time series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'es Abeliuk, Anna Sapienza, Emilio Ferrara, Goran Muric, Mert Ozer","submitted_at":"2019-04-10T03:47:49Z","abstract_excerpt":"How is popularity gained online? Is being successful strictly related to rapidly becoming viral in an online platform or is it possible to acquire popularity in a steady and disciplined fashion? What are other temporal characteristics that can unveil the popularity of online content? To answer these questions, we leverage a multi-faceted temporal analysis of the evolution of popular online contents. Here, we present dipm-SC: a multi-dimensional shape-based time-series clustering algorithm with a heuristic to find the optimal number of clusters. First, we validate the accuracy of our algorithm "},"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":"1904.04994","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-10T03:47:49Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"567b95cf63c1e4dd9d759215b05ab97e0c5d34ec167a0f3e3ee8123c68b40f9e","abstract_canon_sha256":"042d6456e6cb06cd3fc40f6b5fd9f155003b7ebc66345c7abcd761f9d5d2fdc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.478750Z","signature_b64":"tbx7zKXocIYUSiHKKA28YB45gBYuyStWzIYffEKM+djuCF6//N94a71GWxJqnRx8JzA6/Ahr2wW2WMusSulpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"845e8acec4cb9b53e4fbc7d23b0325aa0388d2ed7840b8068360369430e6ba8a","last_reissued_at":"2026-05-17T23:48:54.478179Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.478179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering patterns of online popularity from time series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'es Abeliuk, Anna Sapienza, Emilio Ferrara, Goran Muric, Mert Ozer","submitted_at":"2019-04-10T03:47:49Z","abstract_excerpt":"How is popularity gained online? Is being successful strictly related to rapidly becoming viral in an online platform or is it possible to acquire popularity in a steady and disciplined fashion? What are other temporal characteristics that can unveil the popularity of online content? To answer these questions, we leverage a multi-faceted temporal analysis of the evolution of popular online contents. Here, we present dipm-SC: a multi-dimensional shape-based time-series clustering algorithm with a heuristic to find the optimal number of clusters. First, we validate the accuracy of our algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04994","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":"1904.04994","created_at":"2026-05-17T23:48:54.478284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04994v1","created_at":"2026-05-17T23:48:54.478284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04994","created_at":"2026-05-17T23:48:54.478284+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRPIVTWEZONV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRPIVTWEZONVHZH3","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRPIVTWE","created_at":"2026-05-18T12:33:27.125529+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/QRPIVTWEZONVHZH3Y7JDWAZFVI","json":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI.json","graph_json":"https://pith.science/api/pith-number/QRPIVTWEZONVHZH3Y7JDWAZFVI/graph.json","events_json":"https://pith.science/api/pith-number/QRPIVTWEZONVHZH3Y7JDWAZFVI/events.json","paper":"https://pith.science/paper/QRPIVTWE"},"agent_actions":{"view_html":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI","download_json":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI.json","view_paper":"https://pith.science/paper/QRPIVTWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04994&json=true","fetch_graph":"https://pith.science/api/pith-number/QRPIVTWEZONVHZH3Y7JDWAZFVI/graph.json","fetch_events":"https://pith.science/api/pith-number/QRPIVTWEZONVHZH3Y7JDWAZFVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI/action/storage_attestation","attest_author":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI/action/author_attestation","sign_citation":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI/action/citation_signature","submit_replication":"https://pith.science/pith/QRPIVTWEZONVHZH3Y7JDWAZFVI/action/replication_record"}},"created_at":"2026-05-17T23:48:54.478284+00:00","updated_at":"2026-05-17T23:48:54.478284+00:00"}