{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JQCYQJBXKQLNFEO2E7I6SA3WZA","short_pith_number":"pith:JQCYQJBX","canonical_record":{"source":{"id":"1609.00461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-02T04:03:09Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"6e836ee67caf8463a57bb031b93e6a890f3bff1d711f55e560ca022158532b54","abstract_canon_sha256":"495bddb1e2e7b0b1ab98f1d9949aa043db88d6fd7d4431124d81558043f53a4a"},"schema_version":"1.0"},"canonical_sha256":"4c058824375416d291da27d1e90376c8293ab9f16757961591caf7a562dd9d48","source":{"kind":"arxiv","id":"1609.00461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00461","created_at":"2026-05-18T00:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00461v2","created_at":"2026-05-18T00:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00461","created_at":"2026-05-18T00:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"JQCYQJBXKQLN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JQCYQJBXKQLNFEO2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JQCYQJBX","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JQCYQJBXKQLNFEO2E7I6SA3WZA","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-02T04:03:09Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"6e836ee67caf8463a57bb031b93e6a890f3bff1d711f55e560ca022158532b54","abstract_canon_sha256":"495bddb1e2e7b0b1ab98f1d9949aa043db88d6fd7d4431124d81558043f53a4a"},"schema_version":"1.0"},"canonical_sha256":"4c058824375416d291da27d1e90376c8293ab9f16757961591caf7a562dd9d48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:09.324603Z","signature_b64":"LViTg6yDk3ZBirOql9ghduMkGzqaCw31lgtzAGQYzUc0MLUoAbzHyGrugFvpUTRaKwU9kN+pcpQUTZqZ9RU/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c058824375416d291da27d1e90376c8293ab9f16757961591caf7a562dd9d48","last_reissued_at":"2026-05-18T00:52:09.323866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:09.323866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00461","source_version":2,"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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVLceDLj8aPpqJZN7fe2BEL5xjpGVyMgcCQyI8G0tL43CGdnEquy6tTJjTbF74jMjeTgzh9w3sJGWOBJZrzVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:37:24.070074Z"},"content_sha256":"1052ab99dd7c202bd0119a40b341ce09e42fae8dad8e9f026ce73561ec0914a7","schema_version":"1.0","event_id":"sha256:1052ab99dd7c202bd0119a40b341ce09e42fae8dad8e9f026ce73561ec0914a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JQCYQJBXKQLNFEO2E7I6SA3WZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network clustering and community detection using modulus of families of loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Caterina Scoglio, Heman Shakeri, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2016-09-02T04:03:09Z","abstract_excerpt":"We study the structure of loops in networks using the notion of modulus of loop families. We introduce a new measure of network clustering by quantifying the richness of families of (simple) loops. Modulus tries to minimize the expected overlap among loops by spreading the expected link-usage optimally. We propose weighting networks using these expected link-usages to improve classical community detection algorithms. We show that the proposed method enhances the performance of certain algorithms, such as spectral partitioning and modularity maximization heuristics, on standard benchmarks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00461","kind":"arxiv","version":2},"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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjtyd18CKV5tG4keBwq/8kMdZd39NUoaF0BlPS2k+yL4/ZZe2eNDSRarEUybj1K1lfZJ23HpxYIevOGExhhwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:37:24.070429Z"},"content_sha256":"3a216055b64750ea9ed579a786067aa2a60f8f1b01bcf8c4e61e93aea3f6b46f","schema_version":"1.0","event_id":"sha256:3a216055b64750ea9ed579a786067aa2a60f8f1b01bcf8c4e61e93aea3f6b46f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA/bundle.json","state_url":"https://pith.science/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA/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-09T12:37:24Z","links":{"resolver":"https://pith.science/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA","bundle":"https://pith.science/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA/bundle.json","state":"https://pith.science/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQCYQJBXKQLNFEO2E7I6SA3WZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JQCYQJBXKQLNFEO2E7I6SA3WZA","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":"495bddb1e2e7b0b1ab98f1d9949aa043db88d6fd7d4431124d81558043f53a4a","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-02T04:03:09Z","title_canon_sha256":"6e836ee67caf8463a57bb031b93e6a890f3bff1d711f55e560ca022158532b54"},"schema_version":"1.0","source":{"id":"1609.00461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00461","created_at":"2026-05-18T00:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00461v2","created_at":"2026-05-18T00:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00461","created_at":"2026-05-18T00:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"JQCYQJBXKQLN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JQCYQJBXKQLNFEO2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JQCYQJBX","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:3a216055b64750ea9ed579a786067aa2a60f8f1b01bcf8c4e61e93aea3f6b46f","target":"graph","created_at":"2026-05-18T00:52:09Z","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":"We study the structure of loops in networks using the notion of modulus of loop families. We introduce a new measure of network clustering by quantifying the richness of families of (simple) loops. Modulus tries to minimize the expected overlap among loops by spreading the expected link-usage optimally. We propose weighting networks using these expected link-usages to improve classical community detection algorithms. We show that the proposed method enhances the performance of certain algorithms, such as spectral partitioning and modularity maximization heuristics, on standard benchmarks.","authors_text":"Caterina Scoglio, Heman Shakeri, Nathan Albin, Pietro Poggi-Corradini","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-02T04:03:09Z","title":"Network clustering and community detection using modulus of families of loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00461","kind":"arxiv","version":2},"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:1052ab99dd7c202bd0119a40b341ce09e42fae8dad8e9f026ce73561ec0914a7","target":"record","created_at":"2026-05-18T00:52:09Z","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":"495bddb1e2e7b0b1ab98f1d9949aa043db88d6fd7d4431124d81558043f53a4a","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-02T04:03:09Z","title_canon_sha256":"6e836ee67caf8463a57bb031b93e6a890f3bff1d711f55e560ca022158532b54"},"schema_version":"1.0","source":{"id":"1609.00461","kind":"arxiv","version":2}},"canonical_sha256":"4c058824375416d291da27d1e90376c8293ab9f16757961591caf7a562dd9d48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c058824375416d291da27d1e90376c8293ab9f16757961591caf7a562dd9d48","first_computed_at":"2026-05-18T00:52:09.323866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:09.323866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LViTg6yDk3ZBirOql9ghduMkGzqaCw31lgtzAGQYzUc0MLUoAbzHyGrugFvpUTRaKwU9kN+pcpQUTZqZ9RU/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:09.324603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1052ab99dd7c202bd0119a40b341ce09e42fae8dad8e9f026ce73561ec0914a7","sha256:3a216055b64750ea9ed579a786067aa2a60f8f1b01bcf8c4e61e93aea3f6b46f"],"state_sha256":"714b5c9c3969457f85237a4aa242e144892c887c2e8fb2584745abbf4fb8d5b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ic+Kj3+O+XMdSqNYDh19OSjBVUzfgMjGr1TIfeHycYabFTcKC1li8uL9KFFN/AJp6wVAFrsGLxmANBIcehQ9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:37:24.072187Z","bundle_sha256":"1628b71bb51e54ae14fee864ff0de492abbfa473d164236366741253fe9864f5"}}