{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:525Z4XSF7QHFPYR2BFNTVGBRPB","short_pith_number":"pith:525Z4XSF","schema_version":"1.0","canonical_sha256":"eebb9e5e45fc0e57e23a095b3a983178462f920f0c5195fcc85ef64be0379b54","source":{"kind":"arxiv","id":"1610.00064","version":1},"attestation_state":"computed","paper":{"title":"Faster Kernels for Graphs with Continuous Attributes via Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Morris, Kristian Kersting, Nils M. Kriege, Petra Mutzel","submitted_at":"2016-10-01T00:43:19Z","abstract_excerpt":"While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome this limitation, we present hash graph kernels, a general framework to derive kernels for graphs with continuous attributes from discrete ones. The idea is to iteratively turn continuous attributes into discrete labels using randomized hash functions. We illustrate hash graph kernels for the Weisfeiler-Lehman subtree kernel and for the shortest-path kernel. The resulting novel g"},"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":"1610.00064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-01T00:43:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9fe1e5601fb4c2c5a57ca5246c630f33a72a916997388db11a9f6ccd74111f1a","abstract_canon_sha256":"b767d9f74feabccbd05ca4c25175e6c540b8f489f52cc1dcd0256b8eed297863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:31.979859Z","signature_b64":"wxoGHpJER/cJt/FLcKQuk9SoV/x2sT8Jx9ohTJuGZvGgUSWGrgvKgQL66WjMkzOTf+wS6iSCpmgSK99mgh5FCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eebb9e5e45fc0e57e23a095b3a983178462f920f0c5195fcc85ef64be0379b54","last_reissued_at":"2026-05-18T01:03:31.979211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:31.979211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Kernels for Graphs with Continuous Attributes via Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Morris, Kristian Kersting, Nils M. Kriege, Petra Mutzel","submitted_at":"2016-10-01T00:43:19Z","abstract_excerpt":"While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome this limitation, we present hash graph kernels, a general framework to derive kernels for graphs with continuous attributes from discrete ones. The idea is to iteratively turn continuous attributes into discrete labels using randomized hash functions. We illustrate hash graph kernels for the Weisfeiler-Lehman subtree kernel and for the shortest-path kernel. The resulting novel g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00064","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":"1610.00064","created_at":"2026-05-18T01:03:31.979301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00064v1","created_at":"2026-05-18T01:03:31.979301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00064","created_at":"2026-05-18T01:03:31.979301+00:00"},{"alias_kind":"pith_short_12","alias_value":"525Z4XSF7QHF","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"525Z4XSF7QHFPYR2","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"525Z4XSF","created_at":"2026-05-18T12:29:58.707656+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/525Z4XSF7QHFPYR2BFNTVGBRPB","json":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB.json","graph_json":"https://pith.science/api/pith-number/525Z4XSF7QHFPYR2BFNTVGBRPB/graph.json","events_json":"https://pith.science/api/pith-number/525Z4XSF7QHFPYR2BFNTVGBRPB/events.json","paper":"https://pith.science/paper/525Z4XSF"},"agent_actions":{"view_html":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB","download_json":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB.json","view_paper":"https://pith.science/paper/525Z4XSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00064&json=true","fetch_graph":"https://pith.science/api/pith-number/525Z4XSF7QHFPYR2BFNTVGBRPB/graph.json","fetch_events":"https://pith.science/api/pith-number/525Z4XSF7QHFPYR2BFNTVGBRPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB/action/storage_attestation","attest_author":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB/action/author_attestation","sign_citation":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB/action/citation_signature","submit_replication":"https://pith.science/pith/525Z4XSF7QHFPYR2BFNTVGBRPB/action/replication_record"}},"created_at":"2026-05-18T01:03:31.979301+00:00","updated_at":"2026-05-18T01:03:31.979301+00:00"}