{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:G6QS4EDORHP5A32K2I7FIZQXRF","short_pith_number":"pith:G6QS4EDO","canonical_record":{"source":{"id":"2111.12238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-11-24T03:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"d2ad32c2922318fa00578a83dec9dbe77194ee8e8c252a43aee9139affbaec5c","abstract_canon_sha256":"3ce6a10c705e51140369ed9bbfe8c21b8f78274866c367ba2a1ac877f8d18530"},"schema_version":"1.0"},"canonical_sha256":"37a12e106e89dfd06f4ad23e546617897dee74ef04de487386054d1227e78396","source":{"kind":"arxiv","id":"2111.12238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12238","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12238v1","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12238","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"G6QS4EDORHP5","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"G6QS4EDORHP5A32K","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"G6QS4EDO","created_at":"2026-07-05T03:34:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:G6QS4EDORHP5A32K2I7FIZQXRF","target":"record","payload":{"canonical_record":{"source":{"id":"2111.12238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-11-24T03:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"d2ad32c2922318fa00578a83dec9dbe77194ee8e8c252a43aee9139affbaec5c","abstract_canon_sha256":"3ce6a10c705e51140369ed9bbfe8c21b8f78274866c367ba2a1ac877f8d18530"},"schema_version":"1.0"},"canonical_sha256":"37a12e106e89dfd06f4ad23e546617897dee74ef04de487386054d1227e78396","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:49.797440Z","signature_b64":"V+KAGvs/BpA5mJrU7k0t2XtPQb7OZisnThcq4A9gTYgtbHFk4t824SdZw2eo6XZ4YyJNVanuhsTzgEc1dJkdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a12e106e89dfd06f4ad23e546617897dee74ef04de487386054d1227e78396","last_reissued_at":"2026-07-05T03:34:49.797040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:49.797040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.12238","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-07-05T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/HVSYzNxKdLA19eSBdcvJXJCPyYn6LR6hOQLe9ZKEa6OEQ+kXxzLARAyEKApiVtyslE44Dj3j0WWJA44rzhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:59:23.329469Z"},"content_sha256":"f809970b464963a78b37d8858f570162fc4b62a9b8bc74b09d40e81a469ef8df","schema_version":"1.0","event_id":"sha256:f809970b464963a78b37d8858f570162fc4b62a9b8bc74b09d40e81a469ef8df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:G6QS4EDORHP5A32K2I7FIZQXRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composing Loop-carried Dependence with Other Loops","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kazem Cheshmi, Maryam Mehri Dehnavi, Michelle Mills Strout","submitted_at":"2021-11-24T03:00:16Z","abstract_excerpt":"Sparse fusion is a compile-time loop transformation and runtime scheduling implemented as a domain-specific code generator. Sparse fusion generates efficient parallel code for the combination of two sparse matrix kernels where at least one of the kernels has loop-carried dependencies. Available implementations optimize individual sparse kernels. When optimized separately, the irregular dependence patterns of sparse kernels create synchronization overheads and load imbalance, and their irregular memory access patterns result in inefficient cache usage, which reduces parallel efficiency. Sparse "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12238","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/2111.12238/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-07-05T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgE0/0Ps6XU58YuaxTDzOBLkuLO/Wh+q1g5lp8nOcvVSdRKuBBxJ3hrHSE3piwRXVuK+hML773aQcMheEkfmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:59:23.329846Z"},"content_sha256":"1da20982e0068d9e2fc734747b80da8d6bf692014fc480a9265370f21d54e4aa","schema_version":"1.0","event_id":"sha256:1da20982e0068d9e2fc734747b80da8d6bf692014fc480a9265370f21d54e4aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6QS4EDORHP5A32K2I7FIZQXRF/bundle.json","state_url":"https://pith.science/pith/G6QS4EDORHP5A32K2I7FIZQXRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6QS4EDORHP5A32K2I7FIZQXRF/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-07-07T15:59:23Z","links":{"resolver":"https://pith.science/pith/G6QS4EDORHP5A32K2I7FIZQXRF","bundle":"https://pith.science/pith/G6QS4EDORHP5A32K2I7FIZQXRF/bundle.json","state":"https://pith.science/pith/G6QS4EDORHP5A32K2I7FIZQXRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6QS4EDORHP5A32K2I7FIZQXRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:G6QS4EDORHP5A32K2I7FIZQXRF","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":"3ce6a10c705e51140369ed9bbfe8c21b8f78274866c367ba2a1ac877f8d18530","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-11-24T03:00:16Z","title_canon_sha256":"d2ad32c2922318fa00578a83dec9dbe77194ee8e8c252a43aee9139affbaec5c"},"schema_version":"1.0","source":{"id":"2111.12238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12238","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12238v1","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12238","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"G6QS4EDORHP5","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"G6QS4EDORHP5A32K","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"G6QS4EDO","created_at":"2026-07-05T03:34:49Z"}],"graph_snapshots":[{"event_id":"sha256:1da20982e0068d9e2fc734747b80da8d6bf692014fc480a9265370f21d54e4aa","target":"graph","created_at":"2026-07-05T03:34:49Z","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/2111.12238/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse fusion is a compile-time loop transformation and runtime scheduling implemented as a domain-specific code generator. Sparse fusion generates efficient parallel code for the combination of two sparse matrix kernels where at least one of the kernels has loop-carried dependencies. Available implementations optimize individual sparse kernels. When optimized separately, the irregular dependence patterns of sparse kernels create synchronization overheads and load imbalance, and their irregular memory access patterns result in inefficient cache usage, which reduces parallel efficiency. Sparse ","authors_text":"Kazem Cheshmi, Maryam Mehri Dehnavi, Michelle Mills Strout","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-11-24T03:00:16Z","title":"Composing Loop-carried Dependence with Other Loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12238","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:f809970b464963a78b37d8858f570162fc4b62a9b8bc74b09d40e81a469ef8df","target":"record","created_at":"2026-07-05T03:34:49Z","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":"3ce6a10c705e51140369ed9bbfe8c21b8f78274866c367ba2a1ac877f8d18530","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-11-24T03:00:16Z","title_canon_sha256":"d2ad32c2922318fa00578a83dec9dbe77194ee8e8c252a43aee9139affbaec5c"},"schema_version":"1.0","source":{"id":"2111.12238","kind":"arxiv","version":1}},"canonical_sha256":"37a12e106e89dfd06f4ad23e546617897dee74ef04de487386054d1227e78396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37a12e106e89dfd06f4ad23e546617897dee74ef04de487386054d1227e78396","first_computed_at":"2026-07-05T03:34:49.797040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:34:49.797040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+KAGvs/BpA5mJrU7k0t2XtPQb7OZisnThcq4A9gTYgtbHFk4t824SdZw2eo6XZ4YyJNVanuhsTzgEc1dJkdBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:34:49.797440Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.12238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f809970b464963a78b37d8858f570162fc4b62a9b8bc74b09d40e81a469ef8df","sha256:1da20982e0068d9e2fc734747b80da8d6bf692014fc480a9265370f21d54e4aa"],"state_sha256":"a7fcf24ccca4f6454383c473d7db2d9f5fe1ad027ecb89aac8933269219afd05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SKwKEqOyqsZwRknMFMyqDxSY8BURTt+vZNaYwobSrN5Bl5W+vUm6sTiNKwO/UsMjqsuLY5u9HvcJSB+7IpV/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:59:23.331817Z","bundle_sha256":"0edf9d19f2470304c96824eba8d8f63188118378ad403fbf2961eedf0618c674"}}