{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AUTNV3EAWW7WLSR2NBWTYQVCRH","short_pith_number":"pith:AUTNV3EA","schema_version":"1.0","canonical_sha256":"0526daec80b5bf65ca3a686d3c42a289cc93f97b75dd2664a591eae390693d7d","source":{"kind":"arxiv","id":"2512.08089","version":2},"attestation_state":"computed","paper":{"title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Dhruv Parikh, Jebacyril Arockiaraj, Viktor Prasanna","submitted_at":"2025-12-08T22:47:39Z","abstract_excerpt":"Real-time, energy-efficient inference on edge devices is essential for graph classification across a range of applications. Hyperdimensional Computing (HDC) is a brain-inspired computing paradigm that encodes input features into low-precision, high-dimensional vectors with simple element-wise operations, making it well-suited for resource-constrained edge platforms. Recent work enhances HDC accuracy for graph classification via Nystr\\\"om kernel approximations. Edge acceleration of such methods faces several challenges: (i) redundancy among (landmark) samples selected via uniform sampling, (ii)"},"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":"2512.08089","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-08T22:47:39Z","cross_cats_sorted":[],"title_canon_sha256":"70acc2bdfd0dda8a133352388f4fd00345c5466ac60739013496b442f9e29139","abstract_canon_sha256":"10631a832e8c577b1d63535726d520dcb2ffb1653c3d810992a2d9afcd1372e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:38.983191Z","signature_b64":"QHHetLST5+KG8CCSA0Z5J52jKtTC+F4c4tpxkg0oHPgdkGIE08+JlV7Zt9//Mg+hHpUUxiuKqFKMd6kzF82gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0526daec80b5bf65ca3a686d3c42a289cc93f97b75dd2664a591eae390693d7d","last_reissued_at":"2026-05-20T00:05:38.982363Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:38.982363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Dhruv Parikh, Jebacyril Arockiaraj, Viktor Prasanna","submitted_at":"2025-12-08T22:47:39Z","abstract_excerpt":"Real-time, energy-efficient inference on edge devices is essential for graph classification across a range of applications. Hyperdimensional Computing (HDC) is a brain-inspired computing paradigm that encodes input features into low-precision, high-dimensional vectors with simple element-wise operations, making it well-suited for resource-constrained edge platforms. Recent work enhances HDC accuracy for graph classification via Nystr\\\"om kernel approximations. Edge acceleration of such methods faces several challenges: (i) redundancy among (landmark) samples selected via uniform sampling, (ii)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08089","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.08089/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2512.08089","created_at":"2026-05-20T00:05:38.982503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.08089v2","created_at":"2026-05-20T00:05:38.982503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08089","created_at":"2026-05-20T00:05:38.982503+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUTNV3EAWW7W","created_at":"2026-05-20T00:05:38.982503+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUTNV3EAWW7WLSR2","created_at":"2026-05-20T00:05:38.982503+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUTNV3EA","created_at":"2026-05-20T00:05:38.982503+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/AUTNV3EAWW7WLSR2NBWTYQVCRH","json":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH.json","graph_json":"https://pith.science/api/pith-number/AUTNV3EAWW7WLSR2NBWTYQVCRH/graph.json","events_json":"https://pith.science/api/pith-number/AUTNV3EAWW7WLSR2NBWTYQVCRH/events.json","paper":"https://pith.science/paper/AUTNV3EA"},"agent_actions":{"view_html":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH","download_json":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH.json","view_paper":"https://pith.science/paper/AUTNV3EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.08089&json=true","fetch_graph":"https://pith.science/api/pith-number/AUTNV3EAWW7WLSR2NBWTYQVCRH/graph.json","fetch_events":"https://pith.science/api/pith-number/AUTNV3EAWW7WLSR2NBWTYQVCRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/action/storage_attestation","attest_author":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/action/author_attestation","sign_citation":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/action/citation_signature","submit_replication":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/action/replication_record"}},"created_at":"2026-05-20T00:05:38.982503+00:00","updated_at":"2026-05-20T00:05:38.982503+00:00"}