{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2F2BPGYI5456FFDFRSQAJ34MQI","short_pith_number":"pith:2F2BPGYI","schema_version":"1.0","canonical_sha256":"d174179b08ef3be294658ca004ef8c821dcfd9540591c49b268eb4bcca5217b3","source":{"kind":"arxiv","id":"1803.00425","version":1},"attestation_state":"computed","paper":{"title":"Graph Kernels based on High Order Graphlet Parsing and Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anjan Dutta, Hichem Sahbi","submitted_at":"2018-02-28T12:37:41Z","abstract_excerpt":"Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these non-vectorial graph data cannot be straightforwardly plugged into off-the-shelf machine learning algorithms without a preliminary step of -- explicit/implicit -- graph vectorization and embedding. This embedding process should be resilient to intra-class graph variations while be"},"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":"1803.00425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-28T12:37:41Z","cross_cats_sorted":[],"title_canon_sha256":"b32b7362786b8dfa9253fb16934505a66a2893a1f8402f4821cbeb07c1109402","abstract_canon_sha256":"3fab0c31eddb6f2774bc56dd8b5b96f8ccead3143159f47383d1f4cf182e428a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:12.195054Z","signature_b64":"6ESHk/IzhHnrKmyM70LnsQhXN4DRKUO6Nn5Dl8m7UZZR7hVg26tDp8qMvRmMcjjSzRy2ClTTAoRV42vIBi1ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d174179b08ef3be294658ca004ef8c821dcfd9540591c49b268eb4bcca5217b3","last_reissued_at":"2026-05-18T00:22:12.194572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:12.194572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Kernels based on High Order Graphlet Parsing and Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anjan Dutta, Hichem Sahbi","submitted_at":"2018-02-28T12:37:41Z","abstract_excerpt":"Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these non-vectorial graph data cannot be straightforwardly plugged into off-the-shelf machine learning algorithms without a preliminary step of -- explicit/implicit -- graph vectorization and embedding. This embedding process should be resilient to intra-class graph variations while be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00425","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":"1803.00425","created_at":"2026-05-18T00:22:12.194645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00425v1","created_at":"2026-05-18T00:22:12.194645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00425","created_at":"2026-05-18T00:22:12.194645+00:00"},{"alias_kind":"pith_short_12","alias_value":"2F2BPGYI5456","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2F2BPGYI5456FFDF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2F2BPGYI","created_at":"2026-05-18T12:31:59.375834+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/2F2BPGYI5456FFDFRSQAJ34MQI","json":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI.json","graph_json":"https://pith.science/api/pith-number/2F2BPGYI5456FFDFRSQAJ34MQI/graph.json","events_json":"https://pith.science/api/pith-number/2F2BPGYI5456FFDFRSQAJ34MQI/events.json","paper":"https://pith.science/paper/2F2BPGYI"},"agent_actions":{"view_html":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI","download_json":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI.json","view_paper":"https://pith.science/paper/2F2BPGYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00425&json=true","fetch_graph":"https://pith.science/api/pith-number/2F2BPGYI5456FFDFRSQAJ34MQI/graph.json","fetch_events":"https://pith.science/api/pith-number/2F2BPGYI5456FFDFRSQAJ34MQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI/action/storage_attestation","attest_author":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI/action/author_attestation","sign_citation":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI/action/citation_signature","submit_replication":"https://pith.science/pith/2F2BPGYI5456FFDFRSQAJ34MQI/action/replication_record"}},"created_at":"2026-05-18T00:22:12.194645+00:00","updated_at":"2026-05-18T00:22:12.194645+00:00"}