{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E2GF4SNZW75WTTIXMSCYCA55ZC","short_pith_number":"pith:E2GF4SNZ","canonical_record":{"source":{"id":"1110.3563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-17T02:49:13Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"300681afd75f3c9f4f91daf9c9e231d7dca56420d0c328fff23a16e6c1e27e73","abstract_canon_sha256":"3293f006add98c5185810d4a47dddd86838f545cf72c2e996b50547dc7adc506"},"schema_version":"1.0"},"canonical_sha256":"268c5e49b9b7fb69cd1764858103bdc8b8f3f2364415685e2dfedad077cda24b","source":{"kind":"arxiv","id":"1110.3563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3563","created_at":"2026-05-18T04:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3563v1","created_at":"2026-05-18T04:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3563","created_at":"2026-05-18T04:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"E2GF4SNZW75W","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E2GF4SNZW75WTTIX","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E2GF4SNZ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E2GF4SNZW75WTTIXMSCYCA55ZC","target":"record","payload":{"canonical_record":{"source":{"id":"1110.3563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-17T02:49:13Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"300681afd75f3c9f4f91daf9c9e231d7dca56420d0c328fff23a16e6c1e27e73","abstract_canon_sha256":"3293f006add98c5185810d4a47dddd86838f545cf72c2e996b50547dc7adc506"},"schema_version":"1.0"},"canonical_sha256":"268c5e49b9b7fb69cd1764858103bdc8b8f3f2364415685e2dfedad077cda24b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:48.940213Z","signature_b64":"eOQVYnXQYt8etA1ufjhFmo2DmcH6Ltj0g9M8+uVxr6HyhOrBTY8Xm1FqcBZrTPhyx4yJiPM8Q4zM6vWrEDy0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"268c5e49b9b7fb69cd1764858103bdc8b8f3f2364415685e2dfedad077cda24b","last_reissued_at":"2026-05-18T04:10:48.939760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:48.939760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.3563","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-18T04:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dM+6Y/6XuG51vWohrUMaMsHwmCvUJxSBLsLXNJGHY78QbEf3bfykDIrUgNCj6VD+jk5KHhcCnrx8+44QAMnvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:18:12.056089Z"},"content_sha256":"82250de614d306263b34510b80ce5a8487f7a050257c579a2d8ca50677e0a674","schema_version":"1.0","event_id":"sha256:82250de614d306263b34510b80ce5a8487f7a050257c579a2d8ca50677e0a674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E2GF4SNZW75WTTIXMSCYCA55ZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Clustering Approximation Algorithm Using One Pass Black Box Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Aravind Srinivasan, Jennifer Golbeck, Thomas DuBois","submitted_at":"2011-10-17T02:49:13Z","abstract_excerpt":"Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3563","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-18T04:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5qwX7+7JbkzBhGOzTw8M+kPWGDnFUh8GpwIvOD1w/Kmp6dE3x5HMn5GAXWO+x5tehPMyURB2am9HlUVvvszDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:18:12.056446Z"},"content_sha256":"bbef052a0e3d1438c53d63e5f2acb5765d0d9c88ffd31efe126d9b033969c53c","schema_version":"1.0","event_id":"sha256:bbef052a0e3d1438c53d63e5f2acb5765d0d9c88ffd31efe126d9b033969c53c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2GF4SNZW75WTTIXMSCYCA55ZC/bundle.json","state_url":"https://pith.science/pith/E2GF4SNZW75WTTIXMSCYCA55ZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2GF4SNZW75WTTIXMSCYCA55ZC/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-07-06T16:18:12Z","links":{"resolver":"https://pith.science/pith/E2GF4SNZW75WTTIXMSCYCA55ZC","bundle":"https://pith.science/pith/E2GF4SNZW75WTTIXMSCYCA55ZC/bundle.json","state":"https://pith.science/pith/E2GF4SNZW75WTTIXMSCYCA55ZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2GF4SNZW75WTTIXMSCYCA55ZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E2GF4SNZW75WTTIXMSCYCA55ZC","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":"3293f006add98c5185810d4a47dddd86838f545cf72c2e996b50547dc7adc506","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-17T02:49:13Z","title_canon_sha256":"300681afd75f3c9f4f91daf9c9e231d7dca56420d0c328fff23a16e6c1e27e73"},"schema_version":"1.0","source":{"id":"1110.3563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3563","created_at":"2026-05-18T04:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3563v1","created_at":"2026-05-18T04:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3563","created_at":"2026-05-18T04:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"E2GF4SNZW75W","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E2GF4SNZW75WTTIX","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E2GF4SNZ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:bbef052a0e3d1438c53d63e5f2acb5765d0d9c88ffd31efe126d9b033969c53c","target":"graph","created_at":"2026-05-18T04:10:48Z","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":"Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this s","authors_text":"Aravind Srinivasan, Jennifer Golbeck, Thomas DuBois","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-17T02:49:13Z","title":"Network Clustering Approximation Algorithm Using One Pass Black Box Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3563","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:82250de614d306263b34510b80ce5a8487f7a050257c579a2d8ca50677e0a674","target":"record","created_at":"2026-05-18T04:10:48Z","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":"3293f006add98c5185810d4a47dddd86838f545cf72c2e996b50547dc7adc506","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-17T02:49:13Z","title_canon_sha256":"300681afd75f3c9f4f91daf9c9e231d7dca56420d0c328fff23a16e6c1e27e73"},"schema_version":"1.0","source":{"id":"1110.3563","kind":"arxiv","version":1}},"canonical_sha256":"268c5e49b9b7fb69cd1764858103bdc8b8f3f2364415685e2dfedad077cda24b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"268c5e49b9b7fb69cd1764858103bdc8b8f3f2364415685e2dfedad077cda24b","first_computed_at":"2026-05-18T04:10:48.939760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:48.939760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eOQVYnXQYt8etA1ufjhFmo2DmcH6Ltj0g9M8+uVxr6HyhOrBTY8Xm1FqcBZrTPhyx4yJiPM8Q4zM6vWrEDy0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:48.940213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82250de614d306263b34510b80ce5a8487f7a050257c579a2d8ca50677e0a674","sha256:bbef052a0e3d1438c53d63e5f2acb5765d0d9c88ffd31efe126d9b033969c53c"],"state_sha256":"ad28b17d121cf251388a54cb95544ab4788b1c45c7f55c4fc55b1189ee492c6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v798eluRD1DncGa2CCJnJ+SYkDgdpzLZe1SGjCmbFPMdqkCMiylI5fb8Yyujkk5maBXx3LuKs4x61X9wnp/wCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:18:12.058288Z","bundle_sha256":"9421e68114a7dd547c0f7893cdf93c60bf71fc0be12fd6da37994cab290e3cbb"}}