{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LAQSWTUEWWXGSKPPTA64AK65VV","short_pith_number":"pith:LAQSWTUE","canonical_record":{"source":{"id":"1809.02892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-09-08T22:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"4038fdd8088344cbbf79c5b02156925360b1d9216fb8e0d615010adff8fb2192","abstract_canon_sha256":"cc8409f726d45073460727a6894c2101a914f762f328347149548e3ae71fa918"},"schema_version":"1.0"},"canonical_sha256":"58212b4e84b5ae6929ef983dc02bddad5b45fcb0f8a028d93e81f3327eb2d6f2","source":{"kind":"arxiv","id":"1809.02892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02892","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02892v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02892","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"LAQSWTUEWWXG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LAQSWTUEWWXGSKPP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LAQSWTUE","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LAQSWTUEWWXGSKPPTA64AK65VV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-09-08T22:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"4038fdd8088344cbbf79c5b02156925360b1d9216fb8e0d615010adff8fb2192","abstract_canon_sha256":"cc8409f726d45073460727a6894c2101a914f762f328347149548e3ae71fa918"},"schema_version":"1.0"},"canonical_sha256":"58212b4e84b5ae6929ef983dc02bddad5b45fcb0f8a028d93e81f3327eb2d6f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.771059Z","signature_b64":"Mq197wU88JqdxMIG1TueO4GIscyok4hD2FqnmoafLba6dJodnazwu5Qm+LV7RlHKvuAGQw2pNn294PDxqxd7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58212b4e84b5ae6929ef983dc02bddad5b45fcb0f8a028d93e81f3327eb2d6f2","last_reissued_at":"2026-05-18T00:06:10.770530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.770530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02892","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-18T00:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LaBpF9CpFL9sMWFvr/sU8xfvnqbOy+fcaCIYUGVj7hvdlCKo2+Aeg4PUkR6SyEkTJvSsp/CquYWsvB7MbzySBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:25.151200Z"},"content_sha256":"53166ec30d9fc625dafaff46f46b573b14b4cedffb60872b27727253b64fa39a","schema_version":"1.0","event_id":"sha256:53166ec30d9fc625dafaff46f46b573b14b4cedffb60872b27727253b64fa39a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LAQSWTUEWWXGSKPPTA64AK65VV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dependency Graph Approach for Multiprocessor Real-Time Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Junjie Shi, Niklas Uete","submitted_at":"2018-09-08T22:53:27Z","abstract_excerpt":"Over the years, many multiprocessor locking protocols have been designed and analyzed. However, the performance of these protocols highly depends on how the tasks are partitioned and prioritized and how the resources are shared locally and globally. This paper answers a few fundamental questions when real-time tasks share resources in multiprocessor systems. We explore the fundamental difficulty of the multiprocessor synchronization problem and show that a very simplified version of this problem is ${\\mathcal NP}$-hard in the strong sense regardless of the number of processors and the underlyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02892","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-18T00:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5HDnkj89jfRJ7DONlL3MhIyYJ3sNRoRIVG0NY7h90Hsy4m/zK3nARh5GGpd/FeQidr5Q2hL288YksT3eE9SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:25.151852Z"},"content_sha256":"c3b5780043164c14688f0f866b6bb85716b664689ca6e31a546d1a6f6070030c","schema_version":"1.0","event_id":"sha256:c3b5780043164c14688f0f866b6bb85716b664689ca6e31a546d1a6f6070030c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAQSWTUEWWXGSKPPTA64AK65VV/bundle.json","state_url":"https://pith.science/pith/LAQSWTUEWWXGSKPPTA64AK65VV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAQSWTUEWWXGSKPPTA64AK65VV/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-05-27T05:34:25Z","links":{"resolver":"https://pith.science/pith/LAQSWTUEWWXGSKPPTA64AK65VV","bundle":"https://pith.science/pith/LAQSWTUEWWXGSKPPTA64AK65VV/bundle.json","state":"https://pith.science/pith/LAQSWTUEWWXGSKPPTA64AK65VV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAQSWTUEWWXGSKPPTA64AK65VV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LAQSWTUEWWXGSKPPTA64AK65VV","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":"cc8409f726d45073460727a6894c2101a914f762f328347149548e3ae71fa918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-09-08T22:53:27Z","title_canon_sha256":"4038fdd8088344cbbf79c5b02156925360b1d9216fb8e0d615010adff8fb2192"},"schema_version":"1.0","source":{"id":"1809.02892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02892","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02892v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02892","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"LAQSWTUEWWXG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LAQSWTUEWWXGSKPP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LAQSWTUE","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:c3b5780043164c14688f0f866b6bb85716b664689ca6e31a546d1a6f6070030c","target":"graph","created_at":"2026-05-18T00:06:10Z","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":"Over the years, many multiprocessor locking protocols have been designed and analyzed. However, the performance of these protocols highly depends on how the tasks are partitioned and prioritized and how the resources are shared locally and globally. This paper answers a few fundamental questions when real-time tasks share resources in multiprocessor systems. We explore the fundamental difficulty of the multiprocessor synchronization problem and show that a very simplified version of this problem is ${\\mathcal NP}$-hard in the strong sense regardless of the number of processors and the underlyi","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Junjie Shi, Niklas Uete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-09-08T22:53:27Z","title":"Dependency Graph Approach for Multiprocessor Real-Time Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02892","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:53166ec30d9fc625dafaff46f46b573b14b4cedffb60872b27727253b64fa39a","target":"record","created_at":"2026-05-18T00:06:10Z","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":"cc8409f726d45073460727a6894c2101a914f762f328347149548e3ae71fa918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2018-09-08T22:53:27Z","title_canon_sha256":"4038fdd8088344cbbf79c5b02156925360b1d9216fb8e0d615010adff8fb2192"},"schema_version":"1.0","source":{"id":"1809.02892","kind":"arxiv","version":1}},"canonical_sha256":"58212b4e84b5ae6929ef983dc02bddad5b45fcb0f8a028d93e81f3327eb2d6f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58212b4e84b5ae6929ef983dc02bddad5b45fcb0f8a028d93e81f3327eb2d6f2","first_computed_at":"2026-05-18T00:06:10.770530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:10.770530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mq197wU88JqdxMIG1TueO4GIscyok4hD2FqnmoafLba6dJodnazwu5Qm+LV7RlHKvuAGQw2pNn294PDxqxd7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:10.771059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53166ec30d9fc625dafaff46f46b573b14b4cedffb60872b27727253b64fa39a","sha256:c3b5780043164c14688f0f866b6bb85716b664689ca6e31a546d1a6f6070030c"],"state_sha256":"6f02664b26cfd6eaf57af346a8e87db8ecb8537700d069dd8423efda58e9c6b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RM9ifotCTDp6JdUiS8zKFIntgPMQ1ROejJIpLxVfh6FFL/ZJTTkqbVeTkcYaQDIT4F6NFPr4mT8J+HVsH0zAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:34:25.154899Z","bundle_sha256":"c55c4b44098bba53286e0c51f73625091077935ca8f78a75392de4064434f2bc"}}