{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PZFH7IUW46W4MCZOUO3EJUFBQM","short_pith_number":"pith:PZFH7IUW","canonical_record":{"source":{"id":"1412.0961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-30T07:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"849bc59d67b5423675b1bd9596c0f7e3f84a5b8d0244336e66be64d464eec36c","abstract_canon_sha256":"514dd7752b4d260713ea666561e067185e935ea3517e2afe28b744f0d638e305"},"schema_version":"1.0"},"canonical_sha256":"7e4a7fa296e7adc60b2ea3b644d0a1832b2b06d365554fd8dc18294b792b22d3","source":{"kind":"arxiv","id":"1412.0961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0961","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0961v1","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0961","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"PZFH7IUW46W4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PZFH7IUW46W4MCZO","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PZFH7IUW","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PZFH7IUW46W4MCZOUO3EJUFBQM","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-30T07:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"849bc59d67b5423675b1bd9596c0f7e3f84a5b8d0244336e66be64d464eec36c","abstract_canon_sha256":"514dd7752b4d260713ea666561e067185e935ea3517e2afe28b744f0d638e305"},"schema_version":"1.0"},"canonical_sha256":"7e4a7fa296e7adc60b2ea3b644d0a1832b2b06d365554fd8dc18294b792b22d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:15.259842Z","signature_b64":"3Bn8Dwp0Qm8kSVmaJrwn004L3GQb0ryqycPRBRtiLJFB9Y1MdIWe5DE56kIEjj8iauGPzKDu3/AX13hEL8D1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e4a7fa296e7adc60b2ea3b644d0a1832b2b06d365554fd8dc18294b792b22d3","last_reissued_at":"2026-05-18T02:32:15.259237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:15.259237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0961","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-18T02:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QW/ULUZYMWP0/XF2Pe5XNkCqEaX2RcX3Vhty9bMM/Srr1fz0F2s+ZUiKJjzhVxhQR5dm9M4tj+2SejTmrC85BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:44:23.341721Z"},"content_sha256":"441e0d65f5c750def2d2f5f4bc8c1b5d37b1c9655724db038e82c8013fc805b3","schema_version":"1.0","event_id":"sha256:441e0d65f5c750def2d2f5f4bc8c1b5d37b1c9655724db038e82c8013fc805b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PZFH7IUW46W4MCZOUO3EJUFBQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing Conflict Freedom For Multi-threaded Programs With Time Annotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jingshu Chen (INRIA Nancy - Grand Est / LORIA), Marie Duflot (INRIA Nancy - Grand Est / LORIA), Stephan Merz (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2014-11-30T07:22:03Z","abstract_excerpt":"Avoiding access conflicts is a major challenge in the design of multi-threaded programs. In the context of real-time systems, the absence of conflicts can be guaranteed by ensuring that no two potentially conflicting accesses are ever scheduled concurrently.In this paper, we analyze programs that carry time annotations specifying the time for executing each statement. We propose a technique for verifying that a multi-threaded program with time annotations is free of access conflicts. In particular, we generate constraints that reflect the possible schedules for executing the program and the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0961","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-18T02:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sz+XsuWrjRJpgXb5tY9r8YYptg4j540aR2+I8S7B0w+8dBRedK1clX5qqjJgK2WXvTTyzICoJFPI2vldZnhuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:44:23.342067Z"},"content_sha256":"90fa405e733b145f8f9c3283a03bbd93e5d8d25775ee577a438a3f98549703c7","schema_version":"1.0","event_id":"sha256:90fa405e733b145f8f9c3283a03bbd93e5d8d25775ee577a438a3f98549703c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZFH7IUW46W4MCZOUO3EJUFBQM/bundle.json","state_url":"https://pith.science/pith/PZFH7IUW46W4MCZOUO3EJUFBQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZFH7IUW46W4MCZOUO3EJUFBQM/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-24T17:44:23Z","links":{"resolver":"https://pith.science/pith/PZFH7IUW46W4MCZOUO3EJUFBQM","bundle":"https://pith.science/pith/PZFH7IUW46W4MCZOUO3EJUFBQM/bundle.json","state":"https://pith.science/pith/PZFH7IUW46W4MCZOUO3EJUFBQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZFH7IUW46W4MCZOUO3EJUFBQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PZFH7IUW46W4MCZOUO3EJUFBQM","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":"514dd7752b4d260713ea666561e067185e935ea3517e2afe28b744f0d638e305","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-30T07:22:03Z","title_canon_sha256":"849bc59d67b5423675b1bd9596c0f7e3f84a5b8d0244336e66be64d464eec36c"},"schema_version":"1.0","source":{"id":"1412.0961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0961","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0961v1","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0961","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"PZFH7IUW46W4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PZFH7IUW46W4MCZO","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PZFH7IUW","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:90fa405e733b145f8f9c3283a03bbd93e5d8d25775ee577a438a3f98549703c7","target":"graph","created_at":"2026-05-18T02:32:15Z","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":"Avoiding access conflicts is a major challenge in the design of multi-threaded programs. In the context of real-time systems, the absence of conflicts can be guaranteed by ensuring that no two potentially conflicting accesses are ever scheduled concurrently.In this paper, we analyze programs that carry time annotations specifying the time for executing each statement. We propose a technique for verifying that a multi-threaded program with time annotations is free of access conflicts. In particular, we generate constraints that reflect the possible schedules for executing the program and the re","authors_text":"Jingshu Chen (INRIA Nancy - Grand Est / LORIA), Marie Duflot (INRIA Nancy - Grand Est / LORIA), Stephan Merz (INRIA Nancy - Grand Est / LORIA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-30T07:22:03Z","title":"Analyzing Conflict Freedom For Multi-threaded Programs With Time Annotations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0961","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:441e0d65f5c750def2d2f5f4bc8c1b5d37b1c9655724db038e82c8013fc805b3","target":"record","created_at":"2026-05-18T02:32:15Z","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":"514dd7752b4d260713ea666561e067185e935ea3517e2afe28b744f0d638e305","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-30T07:22:03Z","title_canon_sha256":"849bc59d67b5423675b1bd9596c0f7e3f84a5b8d0244336e66be64d464eec36c"},"schema_version":"1.0","source":{"id":"1412.0961","kind":"arxiv","version":1}},"canonical_sha256":"7e4a7fa296e7adc60b2ea3b644d0a1832b2b06d365554fd8dc18294b792b22d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e4a7fa296e7adc60b2ea3b644d0a1832b2b06d365554fd8dc18294b792b22d3","first_computed_at":"2026-05-18T02:32:15.259237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:15.259237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Bn8Dwp0Qm8kSVmaJrwn004L3GQb0ryqycPRBRtiLJFB9Y1MdIWe5DE56kIEjj8iauGPzKDu3/AX13hEL8D1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:15.259842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:441e0d65f5c750def2d2f5f4bc8c1b5d37b1c9655724db038e82c8013fc805b3","sha256:90fa405e733b145f8f9c3283a03bbd93e5d8d25775ee577a438a3f98549703c7"],"state_sha256":"c50303ff0ccf7117f39dc83dbd1943783693fe726f78006869efd3b6facf9232"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nE5+enydbjFwTT7jZEy+WBfmHBjeHSA0YPeeFfj+ADyLEMHI1ePcPSIZwmidXptblOfrPSBgKC+yZ0/1D7cBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:44:23.344043Z","bundle_sha256":"87bc22256dbeffe469b0ddddf6a03b483f4f43ab1c0934896364272420d5370a"}}