{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FRKHHVKSFYJBFT3HJPO2YDU33V","short_pith_number":"pith:FRKHHVKS","canonical_record":{"source":{"id":"1612.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-02T23:35:25Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4e40640fe589049bb772b0aa604da30637f4c6e5f65ef1a2eae22b01419a0fec","abstract_canon_sha256":"9ce65300f2ef786c65ddf9f6572b8010331536da601a3e2605f6ffe2371269ac"},"schema_version":"1.0"},"canonical_sha256":"2c5473d5522e1212cf674bddac0e9bdd7389af7c8b4488b99ed2846de949d638","source":{"kind":"arxiv","id":"1612.00895","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00895","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00895v2","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00895","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"FRKHHVKSFYJB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRKHHVKSFYJBFT3H","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRKHHVKS","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FRKHHVKSFYJBFT3HJPO2YDU33V","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-02T23:35:25Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4e40640fe589049bb772b0aa604da30637f4c6e5f65ef1a2eae22b01419a0fec","abstract_canon_sha256":"9ce65300f2ef786c65ddf9f6572b8010331536da601a3e2605f6ffe2371269ac"},"schema_version":"1.0"},"canonical_sha256":"2c5473d5522e1212cf674bddac0e9bdd7389af7c8b4488b99ed2846de949d638","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:57.239493Z","signature_b64":"mBoulASpuOBrjVDl7jfUFtdFoKTc1P6Ud8TrBK/dR0z0quZYc/Mo0V/eEckQUNVs1RZJfX//5GYXg3H+JDzjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c5473d5522e1212cf674bddac0e9bdd7389af7c8b4488b99ed2846de949d638","last_reissued_at":"2026-05-18T00:51:57.239015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:57.239015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00895","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vEzl19QZ2PiGwIPsBHGqIK1HvB+Ab3ClTmSsl+53VnP2vf8FooZfGZhWi8cjqpXgPylkbZlsCDOHSh0XbF6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:45:38.405494Z"},"content_sha256":"9dc5b6043ea9946ca7c971314222c5690c8f54d0081ead52d57afc67f43c25ee","schema_version":"1.0","event_id":"sha256:9dc5b6043ea9946ca7c971314222c5690c8f54d0081ead52d57afc67f43c25ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FRKHHVKSFYJBFT3HJPO2YDU33V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motif Clustering and Overlapping Clustering for Social Network Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Gregory Puleo, Hoang Dau, Olgica Milenkovic, Pan Li","submitted_at":"2016-12-02T23:35:25Z","abstract_excerpt":"Motivated by applications in social network community analysis, we introduce a new clustering paradigm termed motif clustering. Unlike classical clustering, motif clustering aims to minimize the number of clustering errors associated with both edges and certain higher order graph structures (motifs) that represent \"atomic units\" of social organizations. Our contributions are two-fold: We first introduce motif correlation clustering, in which the goal is to agnostically partition the vertices of a weighted complete graph so that certain predetermined \"important\" social subgraphs mostly lie with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00895","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMRxF2FqUB7pT6ZK2qWsacPcO/9tos29dXPyh66X9zSZLI1XcdbudEXC7zQ0e3XBIf4Dyr1kzhN7ZERqvEoiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:45:38.405835Z"},"content_sha256":"19f34978a408f6bfdd44fddda98077bc888624568985e1c2e2bfccf5dd2ee6cb","schema_version":"1.0","event_id":"sha256:19f34978a408f6bfdd44fddda98077bc888624568985e1c2e2bfccf5dd2ee6cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRKHHVKSFYJBFT3HJPO2YDU33V/bundle.json","state_url":"https://pith.science/pith/FRKHHVKSFYJBFT3HJPO2YDU33V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRKHHVKSFYJBFT3HJPO2YDU33V/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-21T11:45:38Z","links":{"resolver":"https://pith.science/pith/FRKHHVKSFYJBFT3HJPO2YDU33V","bundle":"https://pith.science/pith/FRKHHVKSFYJBFT3HJPO2YDU33V/bundle.json","state":"https://pith.science/pith/FRKHHVKSFYJBFT3HJPO2YDU33V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRKHHVKSFYJBFT3HJPO2YDU33V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FRKHHVKSFYJBFT3HJPO2YDU33V","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":"9ce65300f2ef786c65ddf9f6572b8010331536da601a3e2605f6ffe2371269ac","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-02T23:35:25Z","title_canon_sha256":"4e40640fe589049bb772b0aa604da30637f4c6e5f65ef1a2eae22b01419a0fec"},"schema_version":"1.0","source":{"id":"1612.00895","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00895","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00895v2","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00895","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"FRKHHVKSFYJB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRKHHVKSFYJBFT3H","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRKHHVKS","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:19f34978a408f6bfdd44fddda98077bc888624568985e1c2e2bfccf5dd2ee6cb","target":"graph","created_at":"2026-05-18T00:51:57Z","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":"Motivated by applications in social network community analysis, we introduce a new clustering paradigm termed motif clustering. Unlike classical clustering, motif clustering aims to minimize the number of clustering errors associated with both edges and certain higher order graph structures (motifs) that represent \"atomic units\" of social organizations. Our contributions are two-fold: We first introduce motif correlation clustering, in which the goal is to agnostically partition the vertices of a weighted complete graph so that certain predetermined \"important\" social subgraphs mostly lie with","authors_text":"Gregory Puleo, Hoang Dau, Olgica Milenkovic, Pan Li","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-02T23:35:25Z","title":"Motif Clustering and Overlapping Clustering for Social Network Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00895","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:9dc5b6043ea9946ca7c971314222c5690c8f54d0081ead52d57afc67f43c25ee","target":"record","created_at":"2026-05-18T00:51:57Z","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":"9ce65300f2ef786c65ddf9f6572b8010331536da601a3e2605f6ffe2371269ac","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-02T23:35:25Z","title_canon_sha256":"4e40640fe589049bb772b0aa604da30637f4c6e5f65ef1a2eae22b01419a0fec"},"schema_version":"1.0","source":{"id":"1612.00895","kind":"arxiv","version":2}},"canonical_sha256":"2c5473d5522e1212cf674bddac0e9bdd7389af7c8b4488b99ed2846de949d638","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c5473d5522e1212cf674bddac0e9bdd7389af7c8b4488b99ed2846de949d638","first_computed_at":"2026-05-18T00:51:57.239015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:57.239015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBoulASpuOBrjVDl7jfUFtdFoKTc1P6Ud8TrBK/dR0z0quZYc/Mo0V/eEckQUNVs1RZJfX//5GYXg3H+JDzjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:57.239493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00895","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dc5b6043ea9946ca7c971314222c5690c8f54d0081ead52d57afc67f43c25ee","sha256:19f34978a408f6bfdd44fddda98077bc888624568985e1c2e2bfccf5dd2ee6cb"],"state_sha256":"3e66628ea0ff58ad42677b497baddc917f9b8abb84770d12314a82d7810e9283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxoQ6+Nw5wJTIRsI7Ngh6eCEgHIYW1Sq3HaIrlLB7Ns3wVFaXHocc2U0rgs3Kf/AqdhBq4A3tklQpbg06XsnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T11:45:38.407767Z","bundle_sha256":"20838f9d1e365ce988930932699cb120737f6414150fecc0eaa9d49a19c4611a"}}