{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7JA6KLUDWW3OOEXG7BNWNAAITL","short_pith_number":"pith:7JA6KLUD","canonical_record":{"source":{"id":"1605.02043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T19:12:06Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"30df0d06eb3c05545e9291afb9b33f6ed463b3a1ef802ed2cd5cc5d33c4c9e7a","abstract_canon_sha256":"fb89d728547aa4804e35bd0917e77a5c79bf36cbf8c5291aff2cfe6708048f23"},"schema_version":"1.0"},"canonical_sha256":"fa41e52e83b5b6e712e6f85b6680089af37ce452cfb90853b3ffba8fbcdce85a","source":{"kind":"arxiv","id":"1605.02043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02043","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02043v1","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02043","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"7JA6KLUDWW3O","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7JA6KLUDWW3OOEXG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7JA6KLUD","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7JA6KLUDWW3OOEXG7BNWNAAITL","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T19:12:06Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"30df0d06eb3c05545e9291afb9b33f6ed463b3a1ef802ed2cd5cc5d33c4c9e7a","abstract_canon_sha256":"fb89d728547aa4804e35bd0917e77a5c79bf36cbf8c5291aff2cfe6708048f23"},"schema_version":"1.0"},"canonical_sha256":"fa41e52e83b5b6e712e6f85b6680089af37ce452cfb90853b3ffba8fbcdce85a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:26.506779Z","signature_b64":"4XB23JcCPWrMgnyNlvVyY5OjjtqtkYlF/FEzbTAZVokPW0rRsi4cvjgkcGoB1Lw475jfDANlczX81izT7IblBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa41e52e83b5b6e712e6f85b6680089af37ce452cfb90853b3ffba8fbcdce85a","last_reissued_at":"2026-05-18T01:03:26.506067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:26.506067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02043","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-18T01:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfp92T51nypbiT2GrrGk5QEz4WaWEf+agE0Nxmqe8sbhBBY8SYRYzYH4Vin+92Fxb3eke7EFML6dY7cPP/8ZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:20:46.823375Z"},"content_sha256":"d2efc5c4dcf749c1db0e546b3ad031afde2fba996a2ba1a27fc530d129d292df","schema_version":"1.0","event_id":"sha256:d2efc5c4dcf749c1db0e546b3ad031afde2fba996a2ba1a27fc530d129d292df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7JA6KLUDWW3OOEXG7BNWNAAITL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph-based Model for GPU Caching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"Ari B. Hayes, Eddy Z. Zhang, Lingda Li, Mario Szegedy, Shuaiwen Leon Song, Stephen A. Hackler","submitted_at":"2016-05-06T19:12:06Z","abstract_excerpt":"Modeling data sharing in GPU programs is a challenging task because of the massive parallelism and complex data sharing patterns provided by GPU architectures. Better GPU caching efficiency can be achieved through careful task scheduling among different threads. Traditionally, in the field of parallel computing, graph partition models are used to model data communication and guide task scheduling. However, we discover that the previous methods are either inaccurate or expensive when applied to GPU programs. In this paper, we propose a novel task partition model that is accurate and gives rise "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02043","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-18T01:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZ3nO6Xjd8cRxHyITuJvTckgAo/88MQeEEHo4Mbd/6bwWE8fE5ijXwXtQ+DzSZ/E9OiZ9D2xt3/1SDXZ3qE2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:20:46.823932Z"},"content_sha256":"9cc06d66a802e2a28f33b43e1a31d3f322967cd260c80362d5ef000f0cf1650c","schema_version":"1.0","event_id":"sha256:9cc06d66a802e2a28f33b43e1a31d3f322967cd260c80362d5ef000f0cf1650c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JA6KLUDWW3OOEXG7BNWNAAITL/bundle.json","state_url":"https://pith.science/pith/7JA6KLUDWW3OOEXG7BNWNAAITL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JA6KLUDWW3OOEXG7BNWNAAITL/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-02T22:20:46Z","links":{"resolver":"https://pith.science/pith/7JA6KLUDWW3OOEXG7BNWNAAITL","bundle":"https://pith.science/pith/7JA6KLUDWW3OOEXG7BNWNAAITL/bundle.json","state":"https://pith.science/pith/7JA6KLUDWW3OOEXG7BNWNAAITL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JA6KLUDWW3OOEXG7BNWNAAITL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7JA6KLUDWW3OOEXG7BNWNAAITL","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":"fb89d728547aa4804e35bd0917e77a5c79bf36cbf8c5291aff2cfe6708048f23","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T19:12:06Z","title_canon_sha256":"30df0d06eb3c05545e9291afb9b33f6ed463b3a1ef802ed2cd5cc5d33c4c9e7a"},"schema_version":"1.0","source":{"id":"1605.02043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02043","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02043v1","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02043","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"7JA6KLUDWW3O","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7JA6KLUDWW3OOEXG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7JA6KLUD","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:9cc06d66a802e2a28f33b43e1a31d3f322967cd260c80362d5ef000f0cf1650c","target":"graph","created_at":"2026-05-18T01:03:26Z","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":"Modeling data sharing in GPU programs is a challenging task because of the massive parallelism and complex data sharing patterns provided by GPU architectures. Better GPU caching efficiency can be achieved through careful task scheduling among different threads. Traditionally, in the field of parallel computing, graph partition models are used to model data communication and guide task scheduling. However, we discover that the previous methods are either inaccurate or expensive when applied to GPU programs. In this paper, we propose a novel task partition model that is accurate and gives rise ","authors_text":"Ari B. Hayes, Eddy Z. Zhang, Lingda Li, Mario Szegedy, Shuaiwen Leon Song, Stephen A. Hackler","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T19:12:06Z","title":"A Graph-based Model for GPU Caching Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02043","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:d2efc5c4dcf749c1db0e546b3ad031afde2fba996a2ba1a27fc530d129d292df","target":"record","created_at":"2026-05-18T01:03:26Z","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":"fb89d728547aa4804e35bd0917e77a5c79bf36cbf8c5291aff2cfe6708048f23","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T19:12:06Z","title_canon_sha256":"30df0d06eb3c05545e9291afb9b33f6ed463b3a1ef802ed2cd5cc5d33c4c9e7a"},"schema_version":"1.0","source":{"id":"1605.02043","kind":"arxiv","version":1}},"canonical_sha256":"fa41e52e83b5b6e712e6f85b6680089af37ce452cfb90853b3ffba8fbcdce85a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa41e52e83b5b6e712e6f85b6680089af37ce452cfb90853b3ffba8fbcdce85a","first_computed_at":"2026-05-18T01:03:26.506067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:26.506067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4XB23JcCPWrMgnyNlvVyY5OjjtqtkYlF/FEzbTAZVokPW0rRsi4cvjgkcGoB1Lw475jfDANlczX81izT7IblBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:26.506779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2efc5c4dcf749c1db0e546b3ad031afde2fba996a2ba1a27fc530d129d292df","sha256:9cc06d66a802e2a28f33b43e1a31d3f322967cd260c80362d5ef000f0cf1650c"],"state_sha256":"4df669c0bed886737e7aab168f186df3f909767a21dc51d73b2c184bb7c2b593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+l/8K8LdvSzYDfDhSQc+NYgD0UZ8MpAVNe38+fd53v76MImZLwBio6jQ8QqLn5pBzbhkoJfgTdNB3Dg3ZApAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:20:46.826710Z","bundle_sha256":"e780fc0589cf92e43b41912745d354411ef8d24ec816ae9be23c7442d3bd4c22"}}