{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LMNXDO277FXF55USSQG4ZC4SSC","short_pith_number":"pith:LMNXDO27","canonical_record":{"source":{"id":"1611.03380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-11-10T16:21:51Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"6d983ce7369886ee3a15a6650732dd5c6a828d587791dba9ded52a4a6a9536bb","abstract_canon_sha256":"add9b0ba67da318c6accdcdd998c4a2de25070fc2467152019433e6550322fef"},"schema_version":"1.0"},"canonical_sha256":"5b1b71bb5ff96e5ef692940dcc8b9290af2a9e9e6cd44ccd032d70b68664d7d2","source":{"kind":"arxiv","id":"1611.03380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03380","created_at":"2026-05-18T00:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03380v1","created_at":"2026-05-18T00:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03380","created_at":"2026-05-18T00:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"LMNXDO277FXF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LMNXDO277FXF55US","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LMNXDO27","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LMNXDO277FXF55USSQG4ZC4SSC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-11-10T16:21:51Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"6d983ce7369886ee3a15a6650732dd5c6a828d587791dba9ded52a4a6a9536bb","abstract_canon_sha256":"add9b0ba67da318c6accdcdd998c4a2de25070fc2467152019433e6550322fef"},"schema_version":"1.0"},"canonical_sha256":"5b1b71bb5ff96e5ef692940dcc8b9290af2a9e9e6cd44ccd032d70b68664d7d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:14.003761Z","signature_b64":"NAVcLNSOqxpipahYNNCjROpTnGzdYtuYwbqaLe3894q7Lkriwy3WaEYmKTKul6Ykkloqco0D7Bp0zX3vD5MPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1b71bb5ff96e5ef692940dcc8b9290af2a9e9e6cd44ccd032d70b68664d7d2","last_reissued_at":"2026-05-18T00:52:14.003105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:14.003105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03380","source_version":1,"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-18T00:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnBGVng/ld+G7g7iUMSG4RHM9rG/t5Idje07f6POGLL1Y5hnHFZCVefWFfb9GjiWZkT2Cbt3xEBbcHhoWM10Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:31:14.660170Z"},"content_sha256":"52e4ebaf3930b5d1101079fda58bdfc89286c605560cd82a30f6e997d5e1ba72","schema_version":"1.0","event_id":"sha256:52e4ebaf3930b5d1101079fda58bdfc89286c605560cd82a30f6e997d5e1ba72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LMNXDO277FXF55USSQG4ZC4SSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-Storage Embedded Accelerator for Sparse Pattern Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AR","authors_text":"Arvind, Huy T. Nguyen, Sang-Woo Jun, Vijay N. Gadepally","submitted_at":"2016-11-10T16:21:51Z","abstract_excerpt":"We present a novel architecture for sparse pattern processing, using flash storage with embedded accelerators. Sparse pattern processing on large data sets is the essence of applications such as document search, natural language processing, bioinformatics, subgraph matching, machine learning, and graph processing. One slice of our prototype accelerator is capable of handling up to 1TB of data, and experiments show that it can outperform C/C++ software solutions on a 16-core system at a fraction of the power and cost; an optimized version of the accelerator can match the performance of a 48-cor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03380","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"},"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-18T00:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtjYuwuvU7OnYPzu4jnOjggOjkCE7UvRG+y2g+UJqiLcf/j0kSU0ANrRUwAvSpnvvy9MI5mw+RBUXv9zmo1zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:31:14.660524Z"},"content_sha256":"beaab342335755b1ab1b3b3e478f24ce9c27c188e93f80ad6c3f5bcdc7e67b25","schema_version":"1.0","event_id":"sha256:beaab342335755b1ab1b3b3e478f24ce9c27c188e93f80ad6c3f5bcdc7e67b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMNXDO277FXF55USSQG4ZC4SSC/bundle.json","state_url":"https://pith.science/pith/LMNXDO277FXF55USSQG4ZC4SSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMNXDO277FXF55USSQG4ZC4SSC/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-06-09T12:31:14Z","links":{"resolver":"https://pith.science/pith/LMNXDO277FXF55USSQG4ZC4SSC","bundle":"https://pith.science/pith/LMNXDO277FXF55USSQG4ZC4SSC/bundle.json","state":"https://pith.science/pith/LMNXDO277FXF55USSQG4ZC4SSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMNXDO277FXF55USSQG4ZC4SSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LMNXDO277FXF55USSQG4ZC4SSC","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":"add9b0ba67da318c6accdcdd998c4a2de25070fc2467152019433e6550322fef","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-11-10T16:21:51Z","title_canon_sha256":"6d983ce7369886ee3a15a6650732dd5c6a828d587791dba9ded52a4a6a9536bb"},"schema_version":"1.0","source":{"id":"1611.03380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03380","created_at":"2026-05-18T00:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03380v1","created_at":"2026-05-18T00:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03380","created_at":"2026-05-18T00:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"LMNXDO277FXF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LMNXDO277FXF55US","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LMNXDO27","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:beaab342335755b1ab1b3b3e478f24ce9c27c188e93f80ad6c3f5bcdc7e67b25","target":"graph","created_at":"2026-05-18T00:52:14Z","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"},"paper":{"abstract_excerpt":"We present a novel architecture for sparse pattern processing, using flash storage with embedded accelerators. Sparse pattern processing on large data sets is the essence of applications such as document search, natural language processing, bioinformatics, subgraph matching, machine learning, and graph processing. One slice of our prototype accelerator is capable of handling up to 1TB of data, and experiments show that it can outperform C/C++ software solutions on a 16-core system at a fraction of the power and cost; an optimized version of the accelerator can match the performance of a 48-cor","authors_text":"Arvind, Huy T. Nguyen, Sang-Woo Jun, Vijay N. Gadepally","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-11-10T16:21:51Z","title":"In-Storage Embedded Accelerator for Sparse Pattern Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03380","kind":"arxiv","version":1},"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:52e4ebaf3930b5d1101079fda58bdfc89286c605560cd82a30f6e997d5e1ba72","target":"record","created_at":"2026-05-18T00:52:14Z","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":"add9b0ba67da318c6accdcdd998c4a2de25070fc2467152019433e6550322fef","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2016-11-10T16:21:51Z","title_canon_sha256":"6d983ce7369886ee3a15a6650732dd5c6a828d587791dba9ded52a4a6a9536bb"},"schema_version":"1.0","source":{"id":"1611.03380","kind":"arxiv","version":1}},"canonical_sha256":"5b1b71bb5ff96e5ef692940dcc8b9290af2a9e9e6cd44ccd032d70b68664d7d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b1b71bb5ff96e5ef692940dcc8b9290af2a9e9e6cd44ccd032d70b68664d7d2","first_computed_at":"2026-05-18T00:52:14.003105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:14.003105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NAVcLNSOqxpipahYNNCjROpTnGzdYtuYwbqaLe3894q7Lkriwy3WaEYmKTKul6Ykkloqco0D7Bp0zX3vD5MPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:14.003761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52e4ebaf3930b5d1101079fda58bdfc89286c605560cd82a30f6e997d5e1ba72","sha256:beaab342335755b1ab1b3b3e478f24ce9c27c188e93f80ad6c3f5bcdc7e67b25"],"state_sha256":"7d85967a5f8cec709201905e320728208664e706c243b633aab65ab17c2f0f00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbttOg1i6wjRfCwwQUZ+AOg30Puly1fZNdJZ0i6y00AWae3tDVWPGW2Ni4hYH2p/BzkfPUHHLjLeNC6h1EEBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:31:14.662418Z","bundle_sha256":"552d64e1c34a9d6df444b17abb7d4c596054843c418dd6cc731e74bef582407b"}}