{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TF7HVY2IN7GHNOBXVJTEB7OO2P","short_pith_number":"pith:TF7HVY2I","canonical_record":{"source":{"id":"1211.4101","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-17T09:29:17Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"8f1060cdd93b4c2cb0a398d4829ca2ad1fbdb5430ab5f690edd7847fd2b3ac84","abstract_canon_sha256":"f4fdcad623bc14d7f529b7c64862324e9a0d97defa1b4639ba70d94f9f218fce"},"schema_version":"1.0"},"canonical_sha256":"997e7ae3486fcc76b837aa6640fdced3c7adc3cca93daf2d55702c06d347ee8d","source":{"kind":"arxiv","id":"1211.4101","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4101","created_at":"2026-05-18T03:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4101v3","created_at":"2026-05-18T03:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4101","created_at":"2026-05-18T03:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"TF7HVY2IN7GH","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TF7HVY2IN7GHNOBX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TF7HVY2I","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TF7HVY2IN7GHNOBXVJTEB7OO2P","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4101","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-17T09:29:17Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"8f1060cdd93b4c2cb0a398d4829ca2ad1fbdb5430ab5f690edd7847fd2b3ac84","abstract_canon_sha256":"f4fdcad623bc14d7f529b7c64862324e9a0d97defa1b4639ba70d94f9f218fce"},"schema_version":"1.0"},"canonical_sha256":"997e7ae3486fcc76b837aa6640fdced3c7adc3cca93daf2d55702c06d347ee8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:07.576521Z","signature_b64":"haTToX2JhbGI27r1rpUCnrur6vBxHS0WPgIMT/uNUwRlVU5UlJaxZWj1rAW3JeoBIfUIPJyWU2HjPgieOORhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"997e7ae3486fcc76b837aa6640fdced3c7adc3cca93daf2d55702c06d347ee8d","last_reissued_at":"2026-05-18T03:32:07.575696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:07.575696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4101","source_version":3,"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-18T03:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zJXlgLjtswXDhaXuietdDXsbu/SiP5londnzCS8I+YvxaIyngTRAyMb4Ol0UG6kBSjuEksEABuGhImLRGuhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:18:48.131351Z"},"content_sha256":"e53b36c24b5dae781b281bc10e8f58685f374f5c1afa1dbd46c37d5be4c78e39","schema_version":"1.0","event_id":"sha256:e53b36c24b5dae781b281bc10e8f58685f374f5c1afa1dbd46c37d5be4c78e39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TF7HVY2IN7GHNOBXVJTEB7OO2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Synchronization Algorithm for Auto-parallelizing Compiler","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"Gang Liao, Long-fei Ma, Qi Sun, Zhi-hui Qin","submitted_at":"2012-11-17T09:29:17Z","abstract_excerpt":"In this paper, we focus on the need for two approaches to optimize producer and consumer synchronization for auto-parallelizing compiler. Emphasis is placed on the construction of a criterion model by which the compiler reduce the number of synchronization operations needed to synchronize the dependence in a loop and perform optimization reduces the overhead of enforcing all dependence. In accordance with our study, we transform to modify and eliminate dependence on iteration space diagram (ISD), and carry out the problems of acyclic and cyclic dependence in detail. we eliminate partial depend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4101","kind":"arxiv","version":3},"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-18T03:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDehc+PTYrtpeBPu+HlfrbdwUC/BmU1iK50su+vWivvjoCo51JO6BY0jLJZqMsXMZdWZ/yOBJ3NJEDossXOLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:18:48.131688Z"},"content_sha256":"0d073c273e674078d59bbe167e90a3ba2732e0476906485095c2e7dde84c4fda","schema_version":"1.0","event_id":"sha256:0d073c273e674078d59bbe167e90a3ba2732e0476906485095c2e7dde84c4fda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P/bundle.json","state_url":"https://pith.science/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P/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-27T18:18:48Z","links":{"resolver":"https://pith.science/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P","bundle":"https://pith.science/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P/bundle.json","state":"https://pith.science/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TF7HVY2IN7GHNOBXVJTEB7OO2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TF7HVY2IN7GHNOBXVJTEB7OO2P","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":"f4fdcad623bc14d7f529b7c64862324e9a0d97defa1b4639ba70d94f9f218fce","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-17T09:29:17Z","title_canon_sha256":"8f1060cdd93b4c2cb0a398d4829ca2ad1fbdb5430ab5f690edd7847fd2b3ac84"},"schema_version":"1.0","source":{"id":"1211.4101","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4101","created_at":"2026-05-18T03:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4101v3","created_at":"2026-05-18T03:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4101","created_at":"2026-05-18T03:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"TF7HVY2IN7GH","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TF7HVY2IN7GHNOBX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TF7HVY2I","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:0d073c273e674078d59bbe167e90a3ba2732e0476906485095c2e7dde84c4fda","target":"graph","created_at":"2026-05-18T03:32:07Z","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":"In this paper, we focus on the need for two approaches to optimize producer and consumer synchronization for auto-parallelizing compiler. Emphasis is placed on the construction of a criterion model by which the compiler reduce the number of synchronization operations needed to synchronize the dependence in a loop and perform optimization reduces the overhead of enforcing all dependence. In accordance with our study, we transform to modify and eliminate dependence on iteration space diagram (ISD), and carry out the problems of acyclic and cyclic dependence in detail. we eliminate partial depend","authors_text":"Gang Liao, Long-fei Ma, Qi Sun, Zhi-hui Qin","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-17T09:29:17Z","title":"Optimizing Synchronization Algorithm for Auto-parallelizing Compiler"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4101","kind":"arxiv","version":3},"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:e53b36c24b5dae781b281bc10e8f58685f374f5c1afa1dbd46c37d5be4c78e39","target":"record","created_at":"2026-05-18T03:32:07Z","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":"f4fdcad623bc14d7f529b7c64862324e9a0d97defa1b4639ba70d94f9f218fce","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-17T09:29:17Z","title_canon_sha256":"8f1060cdd93b4c2cb0a398d4829ca2ad1fbdb5430ab5f690edd7847fd2b3ac84"},"schema_version":"1.0","source":{"id":"1211.4101","kind":"arxiv","version":3}},"canonical_sha256":"997e7ae3486fcc76b837aa6640fdced3c7adc3cca93daf2d55702c06d347ee8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"997e7ae3486fcc76b837aa6640fdced3c7adc3cca93daf2d55702c06d347ee8d","first_computed_at":"2026-05-18T03:32:07.575696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:07.575696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"haTToX2JhbGI27r1rpUCnrur6vBxHS0WPgIMT/uNUwRlVU5UlJaxZWj1rAW3JeoBIfUIPJyWU2HjPgieOORhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:07.576521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4101","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e53b36c24b5dae781b281bc10e8f58685f374f5c1afa1dbd46c37d5be4c78e39","sha256:0d073c273e674078d59bbe167e90a3ba2732e0476906485095c2e7dde84c4fda"],"state_sha256":"d82c8aba0a12bc51faa7fbbf12a2d8a17dc68560aec991d3bbf2e731b3a9c515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UiEjiXrvF3uaKrEoV5FXUCJQvnUD8Gh4+wxEBIqupf7+kGHzjDfSJeAhNmK/XvUU5xURJnWCsHQoMB1BD3ynBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:18:48.133607Z","bundle_sha256":"a1bd6cac84f8c5a0d8bc5edc5012fbe784373a2c05c4061764428266680421aa"}}