{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LGHYHVCHJKMVBBPE5FVHEWUAS4","short_pith_number":"pith:LGHYHVCH","schema_version":"1.0","canonical_sha256":"598f83d4474a995085e4e96a725a809733e1182c5459f7dc6b318618f2c32f78","source":{"kind":"arxiv","id":"1504.05457","version":2},"attestation_state":"computed","paper":{"title":"Graphlet-based lazy associative graph classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Sergei O. Kuznetsov, Yury Kashnitsky","submitted_at":"2015-04-21T15:12:45Z","abstract_excerpt":"The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs up to a fixed size similarly to what is done with graphlet kernels. We explain the idea of the algorithm with a toy example and describe our experiments with a predictive toxicology dataset."},"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":"1504.05457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T15:12:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4d9828a9a60466dd5e80f56d4fe3821d83da96cae522ba5c4be179b96d200f6b","abstract_canon_sha256":"0a702754bffe17bde6c2e1854073409455cff72642dc78b333d2181b39c23b34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:53.997526Z","signature_b64":"VKozxBAfnuWFlwB1PJ7IyanzMd3YKhtm0ditE5uqAxYemTaRgOKfwmtCk6ecGUpKlQOR3+24kDuHCmWJIWdiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"598f83d4474a995085e4e96a725a809733e1182c5459f7dc6b318618f2c32f78","last_reissued_at":"2026-05-18T02:09:53.996761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:53.996761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphlet-based lazy associative graph classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Sergei O. Kuznetsov, Yury Kashnitsky","submitted_at":"2015-04-21T15:12:45Z","abstract_excerpt":"The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs up to a fixed size similarly to what is done with graphlet kernels. We explain the idea of the algorithm with a toy example and describe our experiments with a predictive toxicology dataset."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05457","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":"1504.05457","created_at":"2026-05-18T02:09:53.996886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05457v2","created_at":"2026-05-18T02:09:53.996886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05457","created_at":"2026-05-18T02:09:53.996886+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGHYHVCHJKMV","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGHYHVCHJKMVBBPE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGHYHVCH","created_at":"2026-05-18T12:29:29.992203+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/LGHYHVCHJKMVBBPE5FVHEWUAS4","json":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4.json","graph_json":"https://pith.science/api/pith-number/LGHYHVCHJKMVBBPE5FVHEWUAS4/graph.json","events_json":"https://pith.science/api/pith-number/LGHYHVCHJKMVBBPE5FVHEWUAS4/events.json","paper":"https://pith.science/paper/LGHYHVCH"},"agent_actions":{"view_html":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4","download_json":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4.json","view_paper":"https://pith.science/paper/LGHYHVCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05457&json=true","fetch_graph":"https://pith.science/api/pith-number/LGHYHVCHJKMVBBPE5FVHEWUAS4/graph.json","fetch_events":"https://pith.science/api/pith-number/LGHYHVCHJKMVBBPE5FVHEWUAS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4/action/storage_attestation","attest_author":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4/action/author_attestation","sign_citation":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4/action/citation_signature","submit_replication":"https://pith.science/pith/LGHYHVCHJKMVBBPE5FVHEWUAS4/action/replication_record"}},"created_at":"2026-05-18T02:09:53.996886+00:00","updated_at":"2026-05-18T02:09:53.996886+00:00"}