{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QLQJN5ANOUTVH5E47RIUEAJ6UR","short_pith_number":"pith:QLQJN5AN","schema_version":"1.0","canonical_sha256":"82e096f40d752753f49cfc5142013ea45786fd0b84540eddcac58bef6ac8c38d","source":{"kind":"arxiv","id":"1110.2813","version":2},"attestation_state":"computed","paper":{"title":"Towards Quantifying Vertex Similarity in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Charalampos E. Tsourakakis","submitted_at":"2011-10-12T23:52:28Z","abstract_excerpt":"Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices (graph matching). With respect to the former problem, we propose to optimize a geometric objective which allows us to express each vertex uniquely as a convex combination of a few extreme types of vertices. Our method has the important advantage of supporting efficiently several types of queries such as \"which other vertices are most similar to this vertex?"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1110.2813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-10-12T23:52:28Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"8bac0f646e2bcfaaa17c88a31d8e36029d4356c54d362bdd25c9fc3ef57a55a6","abstract_canon_sha256":"92f7cfac6438b1bfc4406fa4e8c21f96a6106e48b301b339837aa696e7f073b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:54.451394Z","signature_b64":"g5utXLqr1IFy2t1lYsG/So6wp+8u8JGDXDKb7NjzpjbWZE/ziN79vk0WUbElev63btYTGYQDHpc096q3818KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e096f40d752753f49cfc5142013ea45786fd0b84540eddcac58bef6ac8c38d","last_reissued_at":"2026-05-18T03:24:54.450437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:54.450437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Quantifying Vertex Similarity in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Charalampos E. Tsourakakis","submitted_at":"2011-10-12T23:52:28Z","abstract_excerpt":"Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices (graph matching). With respect to the former problem, we propose to optimize a geometric objective which allows us to express each vertex uniquely as a convex combination of a few extreme types of vertices. Our method has the important advantage of supporting efficiently several types of queries such as \"which other vertices are most similar to this vertex?"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2813","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.2813","created_at":"2026-05-18T03:24:54.450607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2813v2","created_at":"2026-05-18T03:24:54.450607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2813","created_at":"2026-05-18T03:24:54.450607+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLQJN5ANOUTV","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLQJN5ANOUTVH5E4","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLQJN5AN","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR","json":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR.json","graph_json":"https://pith.science/api/pith-number/QLQJN5ANOUTVH5E47RIUEAJ6UR/graph.json","events_json":"https://pith.science/api/pith-number/QLQJN5ANOUTVH5E47RIUEAJ6UR/events.json","paper":"https://pith.science/paper/QLQJN5AN"},"agent_actions":{"view_html":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR","download_json":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR.json","view_paper":"https://pith.science/paper/QLQJN5AN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2813&json=true","fetch_graph":"https://pith.science/api/pith-number/QLQJN5ANOUTVH5E47RIUEAJ6UR/graph.json","fetch_events":"https://pith.science/api/pith-number/QLQJN5ANOUTVH5E47RIUEAJ6UR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR/action/storage_attestation","attest_author":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR/action/author_attestation","sign_citation":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR/action/citation_signature","submit_replication":"https://pith.science/pith/QLQJN5ANOUTVH5E47RIUEAJ6UR/action/replication_record"}},"created_at":"2026-05-18T03:24:54.450607+00:00","updated_at":"2026-05-18T03:24:54.450607+00:00"}