{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:R2LSRVIVZSJWZHAQMU4IO3XJEX","short_pith_number":"pith:R2LSRVIV","schema_version":"1.0","canonical_sha256":"8e9728d515cc936c9c106538876ee925f8b46326658424e3673d05e16b12e434","source":{"kind":"arxiv","id":"1102.3937","version":2},"attestation_state":"computed","paper":{"title":"Axiomatic Ranking of Network Role Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hui Hong, Ruoming Jin, Victor E. Lee","submitted_at":"2011-02-18T23:36:05Z","abstract_excerpt":"A key task in social network and other complex network analysis is role analysis: describing and categorizing nodes according to how they interact with other nodes. Two nodes have the same role if they interact with equivalent sets of neighbors. The most fundamental role equivalence is automorphic equivalence. Unfortunately, the fastest algorithms known for graph automorphism are nonpolynomial. Moreover, since exact equivalence may be rare, a more meaningful task is to measure the role similarity between any two nodes. This task is closely related to the structural or link-based similarity pro"},"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":"1102.3937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-02-18T23:36:05Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2b3cc8cf5e0e540111321bca50d1fdaf087cdbfc8480e33f31b441978ab4fd5a","abstract_canon_sha256":"a32cd5bcd27342e25bd02ce6b0a5af82ed003d140fcaf36d49922a3c52360d06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:14.352305Z","signature_b64":"5q0OmLG3B0t0lKc12sKN1KVZwORY7MZCx0uNAbpPpad8ji247OjXt/UzhuUgvL9UioP1LDxH94yvdIufmEVNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e9728d515cc936c9c106538876ee925f8b46326658424e3673d05e16b12e434","last_reissued_at":"2026-05-18T04:20:14.351677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:14.351677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Axiomatic Ranking of Network Role Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hui Hong, Ruoming Jin, Victor E. Lee","submitted_at":"2011-02-18T23:36:05Z","abstract_excerpt":"A key task in social network and other complex network analysis is role analysis: describing and categorizing nodes according to how they interact with other nodes. Two nodes have the same role if they interact with equivalent sets of neighbors. The most fundamental role equivalence is automorphic equivalence. Unfortunately, the fastest algorithms known for graph automorphism are nonpolynomial. Moreover, since exact equivalence may be rare, a more meaningful task is to measure the role similarity between any two nodes. This task is closely related to the structural or link-based similarity pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3937","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":"1102.3937","created_at":"2026-05-18T04:20:14.351772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3937v2","created_at":"2026-05-18T04:20:14.351772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3937","created_at":"2026-05-18T04:20:14.351772+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2LSRVIVZSJW","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2LSRVIVZSJWZHAQ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2LSRVIV","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/R2LSRVIVZSJWZHAQMU4IO3XJEX","json":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX.json","graph_json":"https://pith.science/api/pith-number/R2LSRVIVZSJWZHAQMU4IO3XJEX/graph.json","events_json":"https://pith.science/api/pith-number/R2LSRVIVZSJWZHAQMU4IO3XJEX/events.json","paper":"https://pith.science/paper/R2LSRVIV"},"agent_actions":{"view_html":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX","download_json":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX.json","view_paper":"https://pith.science/paper/R2LSRVIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3937&json=true","fetch_graph":"https://pith.science/api/pith-number/R2LSRVIVZSJWZHAQMU4IO3XJEX/graph.json","fetch_events":"https://pith.science/api/pith-number/R2LSRVIVZSJWZHAQMU4IO3XJEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX/action/storage_attestation","attest_author":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX/action/author_attestation","sign_citation":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX/action/citation_signature","submit_replication":"https://pith.science/pith/R2LSRVIVZSJWZHAQMU4IO3XJEX/action/replication_record"}},"created_at":"2026-05-18T04:20:14.351772+00:00","updated_at":"2026-05-18T04:20:14.351772+00:00"}