{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EHENKX4Q522QZ6Q4JY4PIGTRTB","short_pith_number":"pith:EHENKX4Q","canonical_record":{"source":{"id":"1109.1605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-09-08T00:00:16Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"87cac8e4e2028e9e3711d140b2c74cd1aba4a533fd81668bdfec02f71fdd418d","abstract_canon_sha256":"09e4d5579a713394b8ce5b1ba61608a71bfaf0d8f92cd1607dcdc6a568bb879c"},"schema_version":"1.0"},"canonical_sha256":"21c8d55f90eeb50cfa1c4e38f41a719843915e8175fb73df11aa218d602c2ea1","source":{"kind":"arxiv","id":"1109.1605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1605","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1605v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1605","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"EHENKX4Q522Q","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EHENKX4Q522QZ6Q4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EHENKX4Q","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EHENKX4Q522QZ6Q4JY4PIGTRTB","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-09-08T00:00:16Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"87cac8e4e2028e9e3711d140b2c74cd1aba4a533fd81668bdfec02f71fdd418d","abstract_canon_sha256":"09e4d5579a713394b8ce5b1ba61608a71bfaf0d8f92cd1607dcdc6a568bb879c"},"schema_version":"1.0"},"canonical_sha256":"21c8d55f90eeb50cfa1c4e38f41a719843915e8175fb73df11aa218d602c2ea1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:54.816005Z","signature_b64":"3RjPXwRcE8wgHjI52x+4suy8ZwiQ1ZqDdXXLmFYVYdUDWrURqyaDNQnSKMoPV+axJCp0oppSel7Sgzs/moYnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21c8d55f90eeb50cfa1c4e38f41a719843915e8175fb73df11aa218d602c2ea1","last_reissued_at":"2026-05-18T04:13:54.815540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:54.815540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1605","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:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8gGzJ0l25EneeazK1fJA1rRSt6T7lFCcECjHaRWmrL0bV0bUuog+lSJuoVMdEf1Uk4lRR2wLxA8P0fnlvxuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:37:03.646086Z"},"content_sha256":"6d0b52ea96151e57ca2b07c3e86756b1d544b25937ef513c44cf86922056a409","schema_version":"1.0","event_id":"sha256:6d0b52ea96151e57ca2b07c3e86756b1d544b25937ef513c44cf86922056a409"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EHENKX4Q522QZ6Q4JY4PIGTRTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Clustering on Graphs with Multiple Edge Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ali Pinar, Matthew Rocklin","submitted_at":"2011-09-08T00:00:16Z","abstract_excerpt":"We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where they are published, keyword similarity, citations, etc. As such, graphs with multiple edges is a more accurate model to describe similarities between objects. Each edge/metric provides only partial information about the data; recovering full information requires aggregation of all the similarity metrics. Clustering becomes much more challenging in this context,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1605","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:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27TV6H+VvQWksAn/IW/KPcr5buon0EgN9ifoDyEXUpGWDKih7/9hi44z88emfiXXNUmDbgugdpLby/pmdGqsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:37:03.646770Z"},"content_sha256":"cd5c3fe2e9500b24acf7c3d3133ffc1faf0f2683576d7173c13df89c98fb840b","schema_version":"1.0","event_id":"sha256:cd5c3fe2e9500b24acf7c3d3133ffc1faf0f2683576d7173c13df89c98fb840b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB/bundle.json","state_url":"https://pith.science/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB/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-05T20:37:03Z","links":{"resolver":"https://pith.science/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB","bundle":"https://pith.science/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB/bundle.json","state":"https://pith.science/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHENKX4Q522QZ6Q4JY4PIGTRTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EHENKX4Q522QZ6Q4JY4PIGTRTB","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":"09e4d5579a713394b8ce5b1ba61608a71bfaf0d8f92cd1607dcdc6a568bb879c","cross_cats_sorted":["cs.LG","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-09-08T00:00:16Z","title_canon_sha256":"87cac8e4e2028e9e3711d140b2c74cd1aba4a533fd81668bdfec02f71fdd418d"},"schema_version":"1.0","source":{"id":"1109.1605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1605","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1605v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1605","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"EHENKX4Q522Q","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EHENKX4Q522QZ6Q4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EHENKX4Q","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:cd5c3fe2e9500b24acf7c3d3133ffc1faf0f2683576d7173c13df89c98fb840b","target":"graph","created_at":"2026-05-18T04:13:54Z","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 clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where they are published, keyword similarity, citations, etc. As such, graphs with multiple edges is a more accurate model to describe similarities between objects. Each edge/metric provides only partial information about the data; recovering full information requires aggregation of all the similarity metrics. Clustering becomes much more challenging in this context,","authors_text":"Ali Pinar, Matthew Rocklin","cross_cats":["cs.LG","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-09-08T00:00:16Z","title":"On Clustering on Graphs with Multiple Edge Types"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1605","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:6d0b52ea96151e57ca2b07c3e86756b1d544b25937ef513c44cf86922056a409","target":"record","created_at":"2026-05-18T04:13:54Z","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":"09e4d5579a713394b8ce5b1ba61608a71bfaf0d8f92cd1607dcdc6a568bb879c","cross_cats_sorted":["cs.LG","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-09-08T00:00:16Z","title_canon_sha256":"87cac8e4e2028e9e3711d140b2c74cd1aba4a533fd81668bdfec02f71fdd418d"},"schema_version":"1.0","source":{"id":"1109.1605","kind":"arxiv","version":1}},"canonical_sha256":"21c8d55f90eeb50cfa1c4e38f41a719843915e8175fb73df11aa218d602c2ea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21c8d55f90eeb50cfa1c4e38f41a719843915e8175fb73df11aa218d602c2ea1","first_computed_at":"2026-05-18T04:13:54.815540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:54.815540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3RjPXwRcE8wgHjI52x+4suy8ZwiQ1ZqDdXXLmFYVYdUDWrURqyaDNQnSKMoPV+axJCp0oppSel7Sgzs/moYnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:54.816005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d0b52ea96151e57ca2b07c3e86756b1d544b25937ef513c44cf86922056a409","sha256:cd5c3fe2e9500b24acf7c3d3133ffc1faf0f2683576d7173c13df89c98fb840b"],"state_sha256":"ad28ad1d25213d46a956d4bc1949c0a39041e508ae2917103c7f7b1fcb972b73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U17EhcXcDWHrYC5VAZUGsdHj8vkHqveSW1FWmT3ker/9MBL0FalV2pjLW3tCkhQI370V68gQ2w0d/7sqdQbRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:37:03.650540Z","bundle_sha256":"bac33a36cdc793a3911c274abf6292432abe4f45833a8b10f44fe9527bd5b120"}}