{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2A7IUVR42WRRLBKP4LYFAISAKW","short_pith_number":"pith:2A7IUVR4","schema_version":"1.0","canonical_sha256":"d03e8a563cd5a315854fe2f0502240558f9889cc4afbb1920aefbeac3b70b388","source":{"kind":"arxiv","id":"2512.01193","version":1},"attestation_state":"computed","paper":{"title":"Leveraging Recurrent Patterns in Graph Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Masoud Rahimi, S\\'ebastien Le Beux","submitted_at":"2025-12-01T02:19:56Z","abstract_excerpt":"Graph accelerators have emerged as a promising solution for processing large-scale sparse graphs, leveraging the in-situ compu-tation of ReRAM-based crossbars to maximize computational efficiency. However, existing designs suffer from memristor access overhead due to the large number of graph partitions. This leads to increased execution time, higher energy consumption, and re-duced circuit lifetime. This paper proposes a graph processing method that minimizes memristor write operations by identifying frequent subgraph patterns and assigning them to graph engines, referred to as static, allowi"},"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.01193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-12-01T02:19:56Z","cross_cats_sorted":[],"title_canon_sha256":"dc9f3c761c63ba391dbb9f43a36230516e588e6ec104ea12c6187516293fc7ed","abstract_canon_sha256":"aa08a91f26e43ad1b5521bc8ceea1c4bb3619bb95ede4586b285e3c35fbe2e25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:04.851308Z","signature_b64":"4M+U3+kDYHiJRbUN8cWx+aIdtbilgJcnSKAqeTspD9G5u0fOHHlWEv13YwlL8H7cWJtNLVyzM1KDUZxDb8u8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03e8a563cd5a315854fe2f0502240558f9889cc4afbb1920aefbeac3b70b388","last_reissued_at":"2026-06-08T01:05:04.850560Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:04.850560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Recurrent Patterns in Graph Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Masoud Rahimi, S\\'ebastien Le Beux","submitted_at":"2025-12-01T02:19:56Z","abstract_excerpt":"Graph accelerators have emerged as a promising solution for processing large-scale sparse graphs, leveraging the in-situ compu-tation of ReRAM-based crossbars to maximize computational efficiency. However, existing designs suffer from memristor access overhead due to the large number of graph partitions. This leads to increased execution time, higher energy consumption, and re-duced circuit lifetime. This paper proposes a graph processing method that minimizes memristor write operations by identifying frequent subgraph patterns and assigning them to graph engines, referred to as static, allowi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.01193","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.01193/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.01193","created_at":"2026-06-08T01:05:04.850655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.01193v1","created_at":"2026-06-08T01:05:04.850655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.01193","created_at":"2026-06-08T01:05:04.850655+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A7IUVR42WRR","created_at":"2026-06-08T01:05:04.850655+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A7IUVR42WRRLBKP","created_at":"2026-06-08T01:05:04.850655+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A7IUVR4","created_at":"2026-06-08T01:05:04.850655+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/2A7IUVR42WRRLBKP4LYFAISAKW","json":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW.json","graph_json":"https://pith.science/api/pith-number/2A7IUVR42WRRLBKP4LYFAISAKW/graph.json","events_json":"https://pith.science/api/pith-number/2A7IUVR42WRRLBKP4LYFAISAKW/events.json","paper":"https://pith.science/paper/2A7IUVR4"},"agent_actions":{"view_html":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW","download_json":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW.json","view_paper":"https://pith.science/paper/2A7IUVR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.01193&json=true","fetch_graph":"https://pith.science/api/pith-number/2A7IUVR42WRRLBKP4LYFAISAKW/graph.json","fetch_events":"https://pith.science/api/pith-number/2A7IUVR42WRRLBKP4LYFAISAKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW/action/storage_attestation","attest_author":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW/action/author_attestation","sign_citation":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW/action/citation_signature","submit_replication":"https://pith.science/pith/2A7IUVR42WRRLBKP4LYFAISAKW/action/replication_record"}},"created_at":"2026-06-08T01:05:04.850655+00:00","updated_at":"2026-06-08T01:05:04.850655+00:00"}