{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XUEYA2V5UUIUM7JQKCB7C3E2EU","short_pith_number":"pith:XUEYA2V5","schema_version":"1.0","canonical_sha256":"bd09806abda511467d305083f16c9a2503e511cd7473cf4c0b9d45bcb2bb4339","source":{"kind":"arxiv","id":"1712.04337","version":1},"attestation_state":"computed","paper":{"title":"A Streaming Algorithm for Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Alexandre Hollocou, Julien Maudet, Marc Lelarge, Thomas Bonald","submitted_at":"2017-12-09T14:32:44Z","abstract_excerpt":"We introduce a novel algorithm to perform graph clustering in the edge streaming setting. In this model, the graph is presented as a sequence of edges that can be processed strictly once. Our streaming algorithm has an extremely low memory footprint as it stores only three integers per node and does not keep any edge in memory. We provide a theoretical justification of the design of the algorithm based on the modularity function, which is a usual metric to evaluate the quality of a graph partition. We perform experiments on massive real-life graphs ranging from one million to more than one bil"},"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":"1712.04337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-09T14:32:44Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"eb2440e656c76c8d217d2cf0899e1676c190c36eb163c8af4b466f01890c5c38","abstract_canon_sha256":"a37303ed39890667830d55bd9c749a049b28f87998ec1e0fcfbe5cb8cf758327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:08.325465Z","signature_b64":"qD1Dx0U5ANpDEMydWEUtq2jM7y+st8nGq0Xy76WU1Wp8QZvqr8Wtow7rXnpAjlcpLZM4uSiSyDt/EuMqlrEtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd09806abda511467d305083f16c9a2503e511cd7473cf4c0b9d45bcb2bb4339","last_reissued_at":"2026-05-18T00:28:08.324766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:08.324766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Streaming Algorithm for Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Alexandre Hollocou, Julien Maudet, Marc Lelarge, Thomas Bonald","submitted_at":"2017-12-09T14:32:44Z","abstract_excerpt":"We introduce a novel algorithm to perform graph clustering in the edge streaming setting. In this model, the graph is presented as a sequence of edges that can be processed strictly once. Our streaming algorithm has an extremely low memory footprint as it stores only three integers per node and does not keep any edge in memory. We provide a theoretical justification of the design of the algorithm based on the modularity function, which is a usual metric to evaluate the quality of a graph partition. We perform experiments on massive real-life graphs ranging from one million to more than one bil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04337","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":"1712.04337","created_at":"2026-05-18T00:28:08.324862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04337v1","created_at":"2026-05-18T00:28:08.324862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04337","created_at":"2026-05-18T00:28:08.324862+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUEYA2V5UUIU","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUEYA2V5UUIUM7JQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUEYA2V5","created_at":"2026-05-18T12:31:56.362134+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/XUEYA2V5UUIUM7JQKCB7C3E2EU","json":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU.json","graph_json":"https://pith.science/api/pith-number/XUEYA2V5UUIUM7JQKCB7C3E2EU/graph.json","events_json":"https://pith.science/api/pith-number/XUEYA2V5UUIUM7JQKCB7C3E2EU/events.json","paper":"https://pith.science/paper/XUEYA2V5"},"agent_actions":{"view_html":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU","download_json":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU.json","view_paper":"https://pith.science/paper/XUEYA2V5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04337&json=true","fetch_graph":"https://pith.science/api/pith-number/XUEYA2V5UUIUM7JQKCB7C3E2EU/graph.json","fetch_events":"https://pith.science/api/pith-number/XUEYA2V5UUIUM7JQKCB7C3E2EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU/action/storage_attestation","attest_author":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU/action/author_attestation","sign_citation":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU/action/citation_signature","submit_replication":"https://pith.science/pith/XUEYA2V5UUIUM7JQKCB7C3E2EU/action/replication_record"}},"created_at":"2026-05-18T00:28:08.324862+00:00","updated_at":"2026-05-18T00:28:08.324862+00:00"}