{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N33M2ZGFWTDN7OYVZKGTW2DPFF","short_pith_number":"pith:N33M2ZGF","schema_version":"1.0","canonical_sha256":"6ef6cd64c5b4c6dfbb15ca8d3b686f297b88ba146df45b28cbc1520dcd46850a","source":{"kind":"arxiv","id":"1403.0598","version":1},"attestation_state":"computed","paper":{"title":"The Structurally Smoothed Graphlet Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pinar Yanardag, S.V.N. Vishwanathan","submitted_at":"2014-03-03T21:20:14Z","abstract_excerpt":"A commonly used paradigm for representing graphs is to use a vector that contains normalized frequencies of occurrence of certain motifs or sub-graphs. This vector representation can be used in a variety of applications, such as, for computing similarity between graphs. The graphlet kernel of Shervashidze et al. [32] uses induced sub-graphs of k nodes (christened as graphlets by Przulj [28]) as motifs in the vector representation, and computes the kernel via a dot product between these vectors. One can easily show that this is a valid kernel between graphs. However, such a vector representatio"},"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":"1403.0598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-03T21:20:14Z","cross_cats_sorted":[],"title_canon_sha256":"cbb139b5652ad423998570ff6f61324a05739f05d38a8c465c428b81a4e3db6f","abstract_canon_sha256":"dbea71e33227fb67e42783609fe00ea8caa3757b46c6d7c4f616991bb27af33c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:16.186936Z","signature_b64":"3QCQxUhQnPqAlWjowQOvdR8ltiMhiZ4ohugl/zEFJTGEMgLR4x2FNr4fGwARNu73RXYCuocLT56J2V2Wl00ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef6cd64c5b4c6dfbb15ca8d3b686f297b88ba146df45b28cbc1520dcd46850a","last_reissued_at":"2026-05-18T02:57:16.186262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:16.186262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Structurally Smoothed Graphlet Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pinar Yanardag, S.V.N. Vishwanathan","submitted_at":"2014-03-03T21:20:14Z","abstract_excerpt":"A commonly used paradigm for representing graphs is to use a vector that contains normalized frequencies of occurrence of certain motifs or sub-graphs. This vector representation can be used in a variety of applications, such as, for computing similarity between graphs. The graphlet kernel of Shervashidze et al. [32] uses induced sub-graphs of k nodes (christened as graphlets by Przulj [28]) as motifs in the vector representation, and computes the kernel via a dot product between these vectors. One can easily show that this is a valid kernel between graphs. However, such a vector representatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0598","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":"1403.0598","created_at":"2026-05-18T02:57:16.186374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0598v1","created_at":"2026-05-18T02:57:16.186374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0598","created_at":"2026-05-18T02:57:16.186374+00:00"},{"alias_kind":"pith_short_12","alias_value":"N33M2ZGFWTDN","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N33M2ZGFWTDN7OYV","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N33M2ZGF","created_at":"2026-05-18T12:28:41.024544+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/N33M2ZGFWTDN7OYVZKGTW2DPFF","json":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF.json","graph_json":"https://pith.science/api/pith-number/N33M2ZGFWTDN7OYVZKGTW2DPFF/graph.json","events_json":"https://pith.science/api/pith-number/N33M2ZGFWTDN7OYVZKGTW2DPFF/events.json","paper":"https://pith.science/paper/N33M2ZGF"},"agent_actions":{"view_html":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF","download_json":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF.json","view_paper":"https://pith.science/paper/N33M2ZGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0598&json=true","fetch_graph":"https://pith.science/api/pith-number/N33M2ZGFWTDN7OYVZKGTW2DPFF/graph.json","fetch_events":"https://pith.science/api/pith-number/N33M2ZGFWTDN7OYVZKGTW2DPFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF/action/storage_attestation","attest_author":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF/action/author_attestation","sign_citation":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF/action/citation_signature","submit_replication":"https://pith.science/pith/N33M2ZGFWTDN7OYVZKGTW2DPFF/action/replication_record"}},"created_at":"2026-05-18T02:57:16.186374+00:00","updated_at":"2026-05-18T02:57:16.186374+00:00"}