{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U6EXSDUIXGO6FX6MVGY4MUOZKO","short_pith_number":"pith:U6EXSDUI","canonical_record":{"source":{"id":"1703.02955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-08T18:26:46Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2ef98c1c0e7ec3fa7bb477750824399af4f5579b7a03bfb671cc9e7dfa5c8fc6","abstract_canon_sha256":"0a0fe44a6c129d088a7eeabb3a3d1243588a0842d213a4155eef0bacc7bc34ee"},"schema_version":"1.0"},"canonical_sha256":"a789790e88b99de2dfcca9b1c651d953820b1f806231230a3071f903f8622a27","source":{"kind":"arxiv","id":"1703.02955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02955","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02955v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02955","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"U6EXSDUIXGO6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6EXSDUIXGO6FX6M","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6EXSDUI","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U6EXSDUIXGO6FX6MVGY4MUOZKO","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-08T18:26:46Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2ef98c1c0e7ec3fa7bb477750824399af4f5579b7a03bfb671cc9e7dfa5c8fc6","abstract_canon_sha256":"0a0fe44a6c129d088a7eeabb3a3d1243588a0842d213a4155eef0bacc7bc34ee"},"schema_version":"1.0"},"canonical_sha256":"a789790e88b99de2dfcca9b1c651d953820b1f806231230a3071f903f8622a27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.211576Z","signature_b64":"rKvdWMdRJ/cLdCFSGEoC/4ScUrzmsdfrG/d/I42nHxYeop6ZwwochyHTEkpqbMCaMOl8CLnojAZW4XSjR2vwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a789790e88b99de2dfcca9b1c651d953820b1f806231230a3071f903f8622a27","last_reissued_at":"2026-05-18T00:49:05.211000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.211000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02955","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-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLhORg3Ib/no5yq+xfrwwAHtbkDlF2XfGKYtL0Cu/IYbBDctMokXAXiR9LbA5peej3jO4fT/AMQRfFPuukimCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:51:33.440673Z"},"content_sha256":"b787d2e585911ea60094158c9de89610ab9692be638f84de808307e0640c6b89","schema_version":"1.0","event_id":"sha256:b787d2e585911ea60094158c9de89610ab9692be638f84de808307e0640c6b89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U6EXSDUIXGO6FX6MVGY4MUOZKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear streaming algorithm for community detection in very large networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alexandre Hollocou, Julien Maudet, Marc Lelarge, Thomas Bonald","submitted_at":"2017-03-08T18:26:46Z","abstract_excerpt":"In this paper, we introduce a novel community detection algorithm in graphs, called SCoDA (Streaming Community Detection Algorithm), based on an edge streaming setting. This algorithm has an extremely low memory footprint and a lightning-fast execution time as it only stores two integers per node and processes each edge strictly once. The approach is based on the following simple observation: if we pick an edge uniformly at random in the network, this edge is more likely to connect two nodes of the same community than two nodes of distinct communities. We exploit this idea to build communities"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02955","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-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKqmlBBnePkmc8/h5fzVMELkF9l4R+5NSf8ilADgS+GYSDAQgSF7dcpDZAzxK+3cIRzITM9T12iLTBApu8rtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:51:33.441273Z"},"content_sha256":"64fdb193c18451edfbf07cbcaf66459947e2079763a6ffcdf0888d9d39206590","schema_version":"1.0","event_id":"sha256:64fdb193c18451edfbf07cbcaf66459947e2079763a6ffcdf0888d9d39206590"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO/bundle.json","state_url":"https://pith.science/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO/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-06-08T02:51:33Z","links":{"resolver":"https://pith.science/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO","bundle":"https://pith.science/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO/bundle.json","state":"https://pith.science/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6EXSDUIXGO6FX6MVGY4MUOZKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U6EXSDUIXGO6FX6MVGY4MUOZKO","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":"0a0fe44a6c129d088a7eeabb3a3d1243588a0842d213a4155eef0bacc7bc34ee","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-08T18:26:46Z","title_canon_sha256":"2ef98c1c0e7ec3fa7bb477750824399af4f5579b7a03bfb671cc9e7dfa5c8fc6"},"schema_version":"1.0","source":{"id":"1703.02955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02955","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02955v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02955","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"U6EXSDUIXGO6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6EXSDUIXGO6FX6M","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6EXSDUI","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:64fdb193c18451edfbf07cbcaf66459947e2079763a6ffcdf0888d9d39206590","target":"graph","created_at":"2026-05-18T00:49:05Z","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":"In this paper, we introduce a novel community detection algorithm in graphs, called SCoDA (Streaming Community Detection Algorithm), based on an edge streaming setting. This algorithm has an extremely low memory footprint and a lightning-fast execution time as it only stores two integers per node and processes each edge strictly once. The approach is based on the following simple observation: if we pick an edge uniformly at random in the network, this edge is more likely to connect two nodes of the same community than two nodes of distinct communities. We exploit this idea to build communities","authors_text":"Alexandre Hollocou, Julien Maudet, Marc Lelarge, Thomas Bonald","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-08T18:26:46Z","title":"A linear streaming algorithm for community detection in very large networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02955","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:b787d2e585911ea60094158c9de89610ab9692be638f84de808307e0640c6b89","target":"record","created_at":"2026-05-18T00:49:05Z","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":"0a0fe44a6c129d088a7eeabb3a3d1243588a0842d213a4155eef0bacc7bc34ee","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-08T18:26:46Z","title_canon_sha256":"2ef98c1c0e7ec3fa7bb477750824399af4f5579b7a03bfb671cc9e7dfa5c8fc6"},"schema_version":"1.0","source":{"id":"1703.02955","kind":"arxiv","version":1}},"canonical_sha256":"a789790e88b99de2dfcca9b1c651d953820b1f806231230a3071f903f8622a27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a789790e88b99de2dfcca9b1c651d953820b1f806231230a3071f903f8622a27","first_computed_at":"2026-05-18T00:49:05.211000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:05.211000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rKvdWMdRJ/cLdCFSGEoC/4ScUrzmsdfrG/d/I42nHxYeop6ZwwochyHTEkpqbMCaMOl8CLnojAZW4XSjR2vwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:05.211576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b787d2e585911ea60094158c9de89610ab9692be638f84de808307e0640c6b89","sha256:64fdb193c18451edfbf07cbcaf66459947e2079763a6ffcdf0888d9d39206590"],"state_sha256":"e3b36117c29b06766d6b9d03e2f8823f1a1daa9f6eb1ceffc0854e5527f3f91d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GX7JVK4QBWqY+G7t+OOAXdOjD+Y+Udp9xsKcqZe8VHiu5T+1FJDRcUFumdcfIIQ7Xv4PgDe06U2AVwAqUfqDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:51:33.444567Z","bundle_sha256":"cc9c5bc7f6166a28a17842e1c486f85268d77eed9b92400e0bac8940b0063913"}}