{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7O7MYRES3XVN6X2FU56O7ROMGA","short_pith_number":"pith:7O7MYRES","schema_version":"1.0","canonical_sha256":"fbbecc4492ddeadf5f45a77cefc5cc30265eba30cade41dd2ec8174206bb4602","source":{"kind":"arxiv","id":"1812.09867","version":1},"attestation_state":"computed","paper":{"title":"The content correlation of multiple streaming edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LO","authors_text":"Guillaume Vimont, Michel de Rougemont","submitted_at":"2018-12-24T09:19:10Z","abstract_excerpt":"We study how to detect clusters in a graph defined by a stream of edges, without storing the entire graph. We extend the approach to dynamic graphs defined by the most recent edges of the stream and to several streams. The {\\em content correlation }of two streams $\\rho(t)$ is the Jaccard similarity of their clusters in the windows before time $t$. We propose a simple and efficient method to approximate this correlation online and show that for dynamic random graphs which follow a power law degree distribution, we can guarantee a good approximation. As an application, we follow Twitter streams "},"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.09867","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-12-24T09:19:10Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"8cf0ea4d1a7724941e7456d14b58ef82926ac4b9c176befa57dc66ae4dd5a03d","abstract_canon_sha256":"ac95a4151b9b17211a4651761aaeda88ace3ec43ebc9d16e171ba527886d4b2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.560940Z","signature_b64":"jyRAkhUrlnaBprleQudU8lqPFpmqmugtf8hmF8fWoNDw4F85w46iy+9lxRj641nnnzRveflNpamqW8zJrsgMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbbecc4492ddeadf5f45a77cefc5cc30265eba30cade41dd2ec8174206bb4602","last_reissued_at":"2026-05-17T23:57:26.560271Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.560271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The content correlation of multiple streaming edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LO","authors_text":"Guillaume Vimont, Michel de Rougemont","submitted_at":"2018-12-24T09:19:10Z","abstract_excerpt":"We study how to detect clusters in a graph defined by a stream of edges, without storing the entire graph. We extend the approach to dynamic graphs defined by the most recent edges of the stream and to several streams. The {\\em content correlation }of two streams $\\rho(t)$ is the Jaccard similarity of their clusters in the windows before time $t$. We propose a simple and efficient method to approximate this correlation online and show that for dynamic random graphs which follow a power law degree distribution, we can guarantee a good approximation. As an application, we follow Twitter streams "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09867","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.09867","created_at":"2026-05-17T23:57:26.560399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09867v1","created_at":"2026-05-17T23:57:26.560399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09867","created_at":"2026-05-17T23:57:26.560399+00:00"},{"alias_kind":"pith_short_12","alias_value":"7O7MYRES3XVN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7O7MYRES3XVN6X2F","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7O7MYRES","created_at":"2026-05-18T12:32:11.075285+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/7O7MYRES3XVN6X2FU56O7ROMGA","json":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA.json","graph_json":"https://pith.science/api/pith-number/7O7MYRES3XVN6X2FU56O7ROMGA/graph.json","events_json":"https://pith.science/api/pith-number/7O7MYRES3XVN6X2FU56O7ROMGA/events.json","paper":"https://pith.science/paper/7O7MYRES"},"agent_actions":{"view_html":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA","download_json":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA.json","view_paper":"https://pith.science/paper/7O7MYRES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09867&json=true","fetch_graph":"https://pith.science/api/pith-number/7O7MYRES3XVN6X2FU56O7ROMGA/graph.json","fetch_events":"https://pith.science/api/pith-number/7O7MYRES3XVN6X2FU56O7ROMGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA/action/storage_attestation","attest_author":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA/action/author_attestation","sign_citation":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA/action/citation_signature","submit_replication":"https://pith.science/pith/7O7MYRES3XVN6X2FU56O7ROMGA/action/replication_record"}},"created_at":"2026-05-17T23:57:26.560399+00:00","updated_at":"2026-05-17T23:57:26.560399+00:00"}