{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AUTNV3EAWW7WLSR2NBWTYQVCRH","short_pith_number":"pith:AUTNV3EA","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"},"canonical_sha256":"0526daec80b5bf65ca3a686d3c42a289cc93f97b75dd2664a591eae390693d7d","source":{"kind":"arxiv","id":"2512.08089","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08089","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08089v2","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08089","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"AUTNV3EAWW7W","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"AUTNV3EAWW7WLSR2","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"AUTNV3EA","created_at":"2026-05-20T00:05:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AUTNV3EAWW7WLSR2NBWTYQVCRH","target":"record","payload":{"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"},"canonical_sha256":"0526daec80b5bf65ca3a686d3c42a289cc93f97b75dd2664a591eae390693d7d","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"},"source_kind":"arxiv","source_id":"2512.08089","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YifADXsABE/VDbc2wh7szZpmt8Vldy1xUjBx+0McqB5jJV3Vh5s8purodAgmDnMFQqyo2Wg1Rs+xXaB2b0snCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:52:30.746610Z"},"content_sha256":"bad8dfcf323fc1b07a14349cc8b6e6d75c1164987dab8d81d6b073deb63805fe","schema_version":"1.0","event_id":"sha256:bad8dfcf323fc1b07a14349cc8b6e6d75c1164987dab8d81d6b073deb63805fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AUTNV3EAWW7WLSR2NBWTYQVCRH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"an6zrHYj/nwZZ+3Q2dZOu3oF591K63PuNIw9hFD8FE17DvEG18LY8E8zZDr+K9TSJYoiKH6LgDp4+0qteBdkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:52:30.747342Z"},"content_sha256":"308913105f9dafe55aecb0799d82c3f085250bc86e7435f1c757b8999ecd0e61","schema_version":"1.0","event_id":"sha256:308913105f9dafe55aecb0799d82c3f085250bc86e7435f1c757b8999ecd0e61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/bundle.json","state_url":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T08:52:30Z","links":{"resolver":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH","bundle":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/bundle.json","state":"https://pith.science/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUTNV3EAWW7WLSR2NBWTYQVCRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AUTNV3EAWW7WLSR2NBWTYQVCRH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"10631a832e8c577b1d63535726d520dcb2ffb1653c3d810992a2d9afcd1372e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-08T22:47:39Z","title_canon_sha256":"70acc2bdfd0dda8a133352388f4fd00345c5466ac60739013496b442f9e29139"},"schema_version":"1.0","source":{"id":"2512.08089","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08089","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08089v2","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08089","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"AUTNV3EAWW7W","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"AUTNV3EAWW7WLSR2","created_at":"2026-05-20T00:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"AUTNV3EA","created_at":"2026-05-20T00:05:38Z"}],"graph_snapshots":[{"event_id":"sha256:308913105f9dafe55aecb0799d82c3f085250bc86e7435f1c757b8999ecd0e61","target":"graph","created_at":"2026-05-20T00:05:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.08089/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)","authors_text":"Dhruv Parikh, Jebacyril Arockiaraj, Viktor Prasanna","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-08T22:47:39Z","title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08089","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bad8dfcf323fc1b07a14349cc8b6e6d75c1164987dab8d81d6b073deb63805fe","target":"record","created_at":"2026-05-20T00:05:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"10631a832e8c577b1d63535726d520dcb2ffb1653c3d810992a2d9afcd1372e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-08T22:47:39Z","title_canon_sha256":"70acc2bdfd0dda8a133352388f4fd00345c5466ac60739013496b442f9e29139"},"schema_version":"1.0","source":{"id":"2512.08089","kind":"arxiv","version":2}},"canonical_sha256":"0526daec80b5bf65ca3a686d3c42a289cc93f97b75dd2664a591eae390693d7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0526daec80b5bf65ca3a686d3c42a289cc93f97b75dd2664a591eae390693d7d","first_computed_at":"2026-05-20T00:05:38.982363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:38.982363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QHHetLST5+KG8CCSA0Z5J52jKtTC+F4c4tpxkg0oHPgdkGIE08+JlV7Zt9//Mg+hHpUUxiuKqFKMd6kzF82gBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:38.983191Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.08089","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bad8dfcf323fc1b07a14349cc8b6e6d75c1164987dab8d81d6b073deb63805fe","sha256:308913105f9dafe55aecb0799d82c3f085250bc86e7435f1c757b8999ecd0e61"],"state_sha256":"f9a3ddb80fc8740ccaa3ceffa453c9c4d7c0a0d8f2d7e41602a7d880665dcd70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDwE6ZWav5HZLcKY/5TyUYiucgKO3zjuPwFMnBvKmSA1HW3SnQ0rr0ZPQK7uiYBl8qSghP+tr2ONDk6HW65DCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:52:30.751421Z","bundle_sha256":"50093ac342a8f34174a65c70aae9d00d89bb05232d734bd3592646759dcb0b41"}}