{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FI2GFV75Q724PUFX3BOTDNSYOO","short_pith_number":"pith:FI2GFV75","canonical_record":{"source":{"id":"1405.4332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-17T00:20:07Z","cross_cats_sorted":["cs.CY","cs.IT","math.IT","physics.soc-ph"],"title_canon_sha256":"d9291c50172563c008c3d6dd68086a2344f3b5bf5397ebc9fdef97dd6205187b","abstract_canon_sha256":"3eb6b784e5d88bda40b494a2d448ccdafa1898913aad4efdf31b8b7dd25bcd01"},"schema_version":"1.0"},"canonical_sha256":"2a3462d7fd87f5c7d0b7d85d31b658738a511b420a4525a134886215c15538c5","source":{"kind":"arxiv","id":"1405.4332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4332","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4332v1","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4332","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"FI2GFV75Q724","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FI2GFV75Q724PUFX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FI2GFV75","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FI2GFV75Q724PUFX3BOTDNSYOO","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-17T00:20:07Z","cross_cats_sorted":["cs.CY","cs.IT","math.IT","physics.soc-ph"],"title_canon_sha256":"d9291c50172563c008c3d6dd68086a2344f3b5bf5397ebc9fdef97dd6205187b","abstract_canon_sha256":"3eb6b784e5d88bda40b494a2d448ccdafa1898913aad4efdf31b8b7dd25bcd01"},"schema_version":"1.0"},"canonical_sha256":"2a3462d7fd87f5c7d0b7d85d31b658738a511b420a4525a134886215c15538c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:41.143457Z","signature_b64":"ySdICuFmXjiaz8ayFzpbcXEi1MN75r/LmLzup0HmQolM08eNoyn0dXSmjYqN87QmlYflcDhrVTg4r2zareZMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a3462d7fd87f5c7d0b7d85d31b658738a511b420a4525a134886215c15538c5","last_reissued_at":"2026-05-18T02:51:41.143045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:41.143045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4332","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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwTP9Txxpt0yTl/JvaJkYX62U/CghJxfPhtIr00wW+fgB1+ftXaWV9PZaP9rR8qwCBHjxPwedsKQdJJk6pGWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:04:19.051139Z"},"content_sha256":"e5f9589d463e52d0bade25320c19d82daa5b5604d369b0d4f60da7ee9393d3fb","schema_version":"1.0","event_id":"sha256:e5f9589d463e52d0bade25320c19d82daa5b5604d369b0d4f60da7ee9393d3fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FI2GFV75Q724PUFX3BOTDNSYOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning Networks with Node Attributes by Compressing Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.IT","math.IT","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Allon G. Percus, Kristina Lerman, Laura M. Smith, Linhong Zhu","submitted_at":"2014-05-17T00:20:07Z","abstract_excerpt":"Real-world networks are often organized as modules or communities of similar nodes that serve as functional units. These networks are also rich in content, with nodes having distinguishing features or attributes. In order to discover a network's modular structure, it is necessary to take into account not only its links but also node attributes. We describe an information-theoretic method that identifies modules by compressing descriptions of information flow on a network. Our formulation introduces node content into the description of information flow, which we then minimize to discover groups"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4332","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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/D9iIuWmVJMjhu7DiGz3FAx8Qc85Hr89rMROjKOx/US1gFEri0mrXGjkLo2xcoXvLxc7xZrmFAfvqLZFt9RLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:04:19.051809Z"},"content_sha256":"cfb6e5198b3e265b637746823fe755d8861e6e7d5008f584596831ad03d2600e","schema_version":"1.0","event_id":"sha256:cfb6e5198b3e265b637746823fe755d8861e6e7d5008f584596831ad03d2600e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FI2GFV75Q724PUFX3BOTDNSYOO/bundle.json","state_url":"https://pith.science/pith/FI2GFV75Q724PUFX3BOTDNSYOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FI2GFV75Q724PUFX3BOTDNSYOO/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-04T15:04:19Z","links":{"resolver":"https://pith.science/pith/FI2GFV75Q724PUFX3BOTDNSYOO","bundle":"https://pith.science/pith/FI2GFV75Q724PUFX3BOTDNSYOO/bundle.json","state":"https://pith.science/pith/FI2GFV75Q724PUFX3BOTDNSYOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FI2GFV75Q724PUFX3BOTDNSYOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FI2GFV75Q724PUFX3BOTDNSYOO","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":"3eb6b784e5d88bda40b494a2d448ccdafa1898913aad4efdf31b8b7dd25bcd01","cross_cats_sorted":["cs.CY","cs.IT","math.IT","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-17T00:20:07Z","title_canon_sha256":"d9291c50172563c008c3d6dd68086a2344f3b5bf5397ebc9fdef97dd6205187b"},"schema_version":"1.0","source":{"id":"1405.4332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4332","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4332v1","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4332","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"FI2GFV75Q724","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FI2GFV75Q724PUFX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FI2GFV75","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:cfb6e5198b3e265b637746823fe755d8861e6e7d5008f584596831ad03d2600e","target":"graph","created_at":"2026-05-18T02:51:41Z","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":"Real-world networks are often organized as modules or communities of similar nodes that serve as functional units. These networks are also rich in content, with nodes having distinguishing features or attributes. In order to discover a network's modular structure, it is necessary to take into account not only its links but also node attributes. We describe an information-theoretic method that identifies modules by compressing descriptions of information flow on a network. Our formulation introduces node content into the description of information flow, which we then minimize to discover groups","authors_text":"Allon G. Percus, Kristina Lerman, Laura M. Smith, Linhong Zhu","cross_cats":["cs.CY","cs.IT","math.IT","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-17T00:20:07Z","title":"Partitioning Networks with Node Attributes by Compressing Information Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4332","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:e5f9589d463e52d0bade25320c19d82daa5b5604d369b0d4f60da7ee9393d3fb","target":"record","created_at":"2026-05-18T02:51:41Z","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":"3eb6b784e5d88bda40b494a2d448ccdafa1898913aad4efdf31b8b7dd25bcd01","cross_cats_sorted":["cs.CY","cs.IT","math.IT","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-17T00:20:07Z","title_canon_sha256":"d9291c50172563c008c3d6dd68086a2344f3b5bf5397ebc9fdef97dd6205187b"},"schema_version":"1.0","source":{"id":"1405.4332","kind":"arxiv","version":1}},"canonical_sha256":"2a3462d7fd87f5c7d0b7d85d31b658738a511b420a4525a134886215c15538c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a3462d7fd87f5c7d0b7d85d31b658738a511b420a4525a134886215c15538c5","first_computed_at":"2026-05-18T02:51:41.143045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:41.143045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ySdICuFmXjiaz8ayFzpbcXEi1MN75r/LmLzup0HmQolM08eNoyn0dXSmjYqN87QmlYflcDhrVTg4r2zareZMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:41.143457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5f9589d463e52d0bade25320c19d82daa5b5604d369b0d4f60da7ee9393d3fb","sha256:cfb6e5198b3e265b637746823fe755d8861e6e7d5008f584596831ad03d2600e"],"state_sha256":"549e8d50b72be44b24e1db3f27f158172e708c0533ef6cccf51d50eeb53f528c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1E9/0IMotAGGoSYvWAIDUpVjNsZG+FGVw4xIV6CsniLHqZJuv5n5gSngtq+mRDQEP/lj7jOV5lYXBflj3HukBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:04:19.054649Z","bundle_sha256":"d1b086d19cf47808addb11c1c34150204a2d69cc15be275695bec826c3a7ea73"}}