{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VQRT6YXBZV6A73CJXQATILIG5J","short_pith_number":"pith:VQRT6YXB","canonical_record":{"source":{"id":"1510.02583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-09T07:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"c1e345575a1429ac9c3d5b59954a4ee21ca34da984b9f56a6c0845e9c0e52512","abstract_canon_sha256":"ea4937dccd841dda636b8ea84a7fb09171c927f91c9c65b19d931b073e3f23fd"},"schema_version":"1.0"},"canonical_sha256":"ac233f62e1cd7c0fec49bc01342d06ea7ff86a35f6e36b1f51dcdc77bbde0fa3","source":{"kind":"arxiv","id":"1510.02583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02583","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02583v1","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02583","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"VQRT6YXBZV6A","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VQRT6YXBZV6A73CJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VQRT6YXB","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VQRT6YXBZV6A73CJXQATILIG5J","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-09T07:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"c1e345575a1429ac9c3d5b59954a4ee21ca34da984b9f56a6c0845e9c0e52512","abstract_canon_sha256":"ea4937dccd841dda636b8ea84a7fb09171c927f91c9c65b19d931b073e3f23fd"},"schema_version":"1.0"},"canonical_sha256":"ac233f62e1cd7c0fec49bc01342d06ea7ff86a35f6e36b1f51dcdc77bbde0fa3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:42.007296Z","signature_b64":"86KGf6lE9SVzGvXYEY/shxWDKew/RWiAzVBmdKBEahcfdusJtX9dGKSWI0gGreHHWgrET/jUKhhh9D7rPTSuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac233f62e1cd7c0fec49bc01342d06ea7ff86a35f6e36b1f51dcdc77bbde0fa3","last_reissued_at":"2026-05-18T01:30:42.006655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:42.006655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02583","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-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmLrDiUl5ukz4NO+zjVB3oBy7mzt24+t6Vhmaz+5+PjbgRWJvx/oTaijbxTBJY2zBTPs9mDQRjADqxE4NR57Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:07:29.087776Z"},"content_sha256":"ac377660a681a6a904e894597fe8373221e403aa6c253491ab2ebf627cbaee92","schema_version":"1.0","event_id":"sha256:ac377660a681a6a904e894597fe8373221e403aa6c253491ab2ebf627cbaee92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VQRT6YXBZV6A73CJXQATILIG5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Community Detection Using Slow Mixing Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Narayana Prasad Santhanam, Ramezan Paravi Torghabeh","submitted_at":"2015-10-09T07:20:06Z","abstract_excerpt":"The task of \\emph{community detection} in a graph formalizes the intuitive task of grouping together subsets of vertices such that vertices within clusters are connected tighter than those in disparate clusters. This paper approaches community detection in graphs by constructing Markov random walks on the graphs. The mixing properties of the random walk are then used to identify communities. We use coupling from the past as an algorithmic primitive to translate the mixing properties of the walk into revealing the community structure of the graph. We analyze the performance of our algorithms on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02583","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-18T01:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qbGpJ+3QIRSTfammb9zC/+Xg15CayU8TkJGRY6K+lDYubsoo6xGUtJd74rw0GQifGArkABzPxUDz22fyBjwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:07:29.088125Z"},"content_sha256":"9a7ecc6bf3fa7f3c5969f97110a320d4dc2e7a94c97c36d157454cfc258895e3","schema_version":"1.0","event_id":"sha256:9a7ecc6bf3fa7f3c5969f97110a320d4dc2e7a94c97c36d157454cfc258895e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQRT6YXBZV6A73CJXQATILIG5J/bundle.json","state_url":"https://pith.science/pith/VQRT6YXBZV6A73CJXQATILIG5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQRT6YXBZV6A73CJXQATILIG5J/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-23T22:07:29Z","links":{"resolver":"https://pith.science/pith/VQRT6YXBZV6A73CJXQATILIG5J","bundle":"https://pith.science/pith/VQRT6YXBZV6A73CJXQATILIG5J/bundle.json","state":"https://pith.science/pith/VQRT6YXBZV6A73CJXQATILIG5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQRT6YXBZV6A73CJXQATILIG5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VQRT6YXBZV6A73CJXQATILIG5J","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":"ea4937dccd841dda636b8ea84a7fb09171c927f91c9c65b19d931b073e3f23fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-09T07:20:06Z","title_canon_sha256":"c1e345575a1429ac9c3d5b59954a4ee21ca34da984b9f56a6c0845e9c0e52512"},"schema_version":"1.0","source":{"id":"1510.02583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02583","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02583v1","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02583","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"VQRT6YXBZV6A","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VQRT6YXBZV6A73CJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VQRT6YXB","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:9a7ecc6bf3fa7f3c5969f97110a320d4dc2e7a94c97c36d157454cfc258895e3","target":"graph","created_at":"2026-05-18T01:30:42Z","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":"The task of \\emph{community detection} in a graph formalizes the intuitive task of grouping together subsets of vertices such that vertices within clusters are connected tighter than those in disparate clusters. This paper approaches community detection in graphs by constructing Markov random walks on the graphs. The mixing properties of the random walk are then used to identify communities. We use coupling from the past as an algorithmic primitive to translate the mixing properties of the walk into revealing the community structure of the graph. We analyze the performance of our algorithms on","authors_text":"Narayana Prasad Santhanam, Ramezan Paravi Torghabeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-09T07:20:06Z","title":"Community Detection Using Slow Mixing Markov Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02583","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:ac377660a681a6a904e894597fe8373221e403aa6c253491ab2ebf627cbaee92","target":"record","created_at":"2026-05-18T01:30:42Z","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":"ea4937dccd841dda636b8ea84a7fb09171c927f91c9c65b19d931b073e3f23fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-09T07:20:06Z","title_canon_sha256":"c1e345575a1429ac9c3d5b59954a4ee21ca34da984b9f56a6c0845e9c0e52512"},"schema_version":"1.0","source":{"id":"1510.02583","kind":"arxiv","version":1}},"canonical_sha256":"ac233f62e1cd7c0fec49bc01342d06ea7ff86a35f6e36b1f51dcdc77bbde0fa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac233f62e1cd7c0fec49bc01342d06ea7ff86a35f6e36b1f51dcdc77bbde0fa3","first_computed_at":"2026-05-18T01:30:42.006655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:42.006655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"86KGf6lE9SVzGvXYEY/shxWDKew/RWiAzVBmdKBEahcfdusJtX9dGKSWI0gGreHHWgrET/jUKhhh9D7rPTSuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:42.007296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac377660a681a6a904e894597fe8373221e403aa6c253491ab2ebf627cbaee92","sha256:9a7ecc6bf3fa7f3c5969f97110a320d4dc2e7a94c97c36d157454cfc258895e3"],"state_sha256":"26a76ad2880a3419b95c7808b94d50c6b6f351f1c6a6a044d36b6e548d69ddb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAy04RFVX3Z2yZWa9xZuVOJkx3crBwksrw/MNYERPx1UlP+b4Ww6ehAP1emVv6+AIxkpbXugQqLSVMzJtzuKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:07:29.090106Z","bundle_sha256":"4f17b3c309ffaac92bdfa75ca5c1068c6be837f1e279a9ef256ad2f4003f5be2"}}