{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZRR4ETNJGTD3CZXXAQE3KIDFRT","short_pith_number":"pith:ZRR4ETNJ","schema_version":"1.0","canonical_sha256":"cc63c24da934c7b166f70409b520658cddee65c442dce6963c4f08023eb8a847","source":{"kind":"arxiv","id":"1609.02646","version":1},"attestation_state":"computed","paper":{"title":"Some Advances in Role Discovery in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chia-Tung Kuo, Ian Davidson, Sean Gilpin, Tina Eliassi-Rad","submitted_at":"2016-09-09T03:13:55Z","abstract_excerpt":"Role discovery in graphs is an emerging area that allows analysis of complex graphs in an intuitive way. In contrast to other graph prob- lems such as community discovery, which finds groups of highly connected nodes, the role discovery problem finds groups of nodes that share similar graph topological structure. However, existing work so far has two severe limitations that prevent its use in some domains. Firstly, it is completely unsupervised which is undesirable for a number of reasons. Secondly, most work is limited to a single relational graph. We address both these lim- itations in an in"},"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":"1609.02646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-09T03:13:55Z","cross_cats_sorted":[],"title_canon_sha256":"44fc736e0c4a4bbd21ccb512001cf11534d2462654af305b9eb6feff0aecd8d6","abstract_canon_sha256":"b5dbbc9eab4ad540354f14d4effd04a5b57029387547788253c7649944c21dce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:52.888859Z","signature_b64":"cZgRxVjy4Hqo8yb33Qx40PUfGY8PK0695xbn+CPo29N1HEaOyjla1c6BbVlOYuh+xOSfaLOPQr8MmTCL8YS3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc63c24da934c7b166f70409b520658cddee65c442dce6963c4f08023eb8a847","last_reissued_at":"2026-05-18T01:04:52.887018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:52.887018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Advances in Role Discovery in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chia-Tung Kuo, Ian Davidson, Sean Gilpin, Tina Eliassi-Rad","submitted_at":"2016-09-09T03:13:55Z","abstract_excerpt":"Role discovery in graphs is an emerging area that allows analysis of complex graphs in an intuitive way. In contrast to other graph prob- lems such as community discovery, which finds groups of highly connected nodes, the role discovery problem finds groups of nodes that share similar graph topological structure. However, existing work so far has two severe limitations that prevent its use in some domains. Firstly, it is completely unsupervised which is undesirable for a number of reasons. Secondly, most work is limited to a single relational graph. We address both these lim- itations in an in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02646","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.02646","created_at":"2026-05-18T01:04:52.888345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02646v1","created_at":"2026-05-18T01:04:52.888345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02646","created_at":"2026-05-18T01:04:52.888345+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRR4ETNJGTD3","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRR4ETNJGTD3CZXX","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRR4ETNJ","created_at":"2026-05-18T12:30:55.937587+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/ZRR4ETNJGTD3CZXXAQE3KIDFRT","json":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT.json","graph_json":"https://pith.science/api/pith-number/ZRR4ETNJGTD3CZXXAQE3KIDFRT/graph.json","events_json":"https://pith.science/api/pith-number/ZRR4ETNJGTD3CZXXAQE3KIDFRT/events.json","paper":"https://pith.science/paper/ZRR4ETNJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT","download_json":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT.json","view_paper":"https://pith.science/paper/ZRR4ETNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02646&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRR4ETNJGTD3CZXXAQE3KIDFRT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRR4ETNJGTD3CZXXAQE3KIDFRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT/action/storage_attestation","attest_author":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT/action/author_attestation","sign_citation":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT/action/citation_signature","submit_replication":"https://pith.science/pith/ZRR4ETNJGTD3CZXXAQE3KIDFRT/action/replication_record"}},"created_at":"2026-05-18T01:04:52.888345+00:00","updated_at":"2026-05-18T01:04:52.888345+00:00"}