{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TFJKDEHABMPH2EOOHIUGUKP357","short_pith_number":"pith:TFJKDEHA","schema_version":"1.0","canonical_sha256":"9952a190e00b1e7d11ce3a286a29fbeff502f813f3b827e4cf7487e8c9bf15fa","source":{"kind":"arxiv","id":"2606.26701","version":1},"attestation_state":"computed","paper":{"title":"SegFold: Accelerating Sparse GEMM with a Fine-Grained Dynamic Dataflow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hanyu Wang, Jason Cong, Tony Nowatzki, Xinrui Wu","submitted_at":"2026-06-25T07:32:26Z","abstract_excerpt":"Generalized sparse matrix-matrix multiplication (SpGEMM) is critical in many domains. Existing CPUs and GPUs, as well as specialized accelerators, rely on static dataflows (e.g., inner product, outer product, Gustavson, etc.). Each static dataflow sacrifices some data reuse opportunities and imposes constraints on load balance.\n  To address this inefficiency, we extend the typical SpGEMM dataflows by considering dynamism. Specifically, we add fine-grained dynamic scheduling to optimize reuse and reduce resource contention. We also develop dynamic remapping of partially completed work to improv"},"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":"2606.26701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2026-06-25T07:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"527ed9a90487aa57f31bf9e18eccdd6cbc958bf9238908b13b82aa5013f7cf5c","abstract_canon_sha256":"9b2e58db5514ce8799131f9a2f72f6e04c65c542ebc8f28ce64a62081213a0d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:57.245658Z","signature_b64":"HQ5Bph886S8MnrS9U2X6/JhayHb+eHxEBT/W0RneGIZrbr5cjgOMoatGv2dKoAKpf6SfWCKLTzmaH4pb8Uw5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9952a190e00b1e7d11ce3a286a29fbeff502f813f3b827e4cf7487e8c9bf15fa","last_reissued_at":"2026-06-26T01:15:57.245249Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:57.245249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SegFold: Accelerating Sparse GEMM with a Fine-Grained Dynamic Dataflow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hanyu Wang, Jason Cong, Tony Nowatzki, Xinrui Wu","submitted_at":"2026-06-25T07:32:26Z","abstract_excerpt":"Generalized sparse matrix-matrix multiplication (SpGEMM) is critical in many domains. Existing CPUs and GPUs, as well as specialized accelerators, rely on static dataflows (e.g., inner product, outer product, Gustavson, etc.). Each static dataflow sacrifices some data reuse opportunities and imposes constraints on load balance.\n  To address this inefficiency, we extend the typical SpGEMM dataflows by considering dynamism. Specifically, we add fine-grained dynamic scheduling to optimize reuse and reduce resource contention. We also develop dynamic remapping of partially completed work to improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26701","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/2606.26701/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":"2606.26701","created_at":"2026-06-26T01:15:57.245304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26701v1","created_at":"2026-06-26T01:15:57.245304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26701","created_at":"2026-06-26T01:15:57.245304+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFJKDEHABMPH","created_at":"2026-06-26T01:15:57.245304+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFJKDEHABMPH2EOO","created_at":"2026-06-26T01:15:57.245304+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFJKDEHA","created_at":"2026-06-26T01:15:57.245304+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/TFJKDEHABMPH2EOOHIUGUKP357","json":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357.json","graph_json":"https://pith.science/api/pith-number/TFJKDEHABMPH2EOOHIUGUKP357/graph.json","events_json":"https://pith.science/api/pith-number/TFJKDEHABMPH2EOOHIUGUKP357/events.json","paper":"https://pith.science/paper/TFJKDEHA"},"agent_actions":{"view_html":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357","download_json":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357.json","view_paper":"https://pith.science/paper/TFJKDEHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26701&json=true","fetch_graph":"https://pith.science/api/pith-number/TFJKDEHABMPH2EOOHIUGUKP357/graph.json","fetch_events":"https://pith.science/api/pith-number/TFJKDEHABMPH2EOOHIUGUKP357/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357/action/storage_attestation","attest_author":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357/action/author_attestation","sign_citation":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357/action/citation_signature","submit_replication":"https://pith.science/pith/TFJKDEHABMPH2EOOHIUGUKP357/action/replication_record"}},"created_at":"2026-06-26T01:15:57.245304+00:00","updated_at":"2026-06-26T01:15:57.245304+00:00"}