{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QB6PUOTOPACP23KFOSUBDC7PX6","short_pith_number":"pith:QB6PUOTO","schema_version":"1.0","canonical_sha256":"807cfa3a6e7804fd6d4574a8118befbfa46706b6b173f47d5abb07df89eceaab","source":{"kind":"arxiv","id":"1010.4411","version":1},"attestation_state":"computed","paper":{"title":"Revisiting deadlock prevention: a probabilistic approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.DC","authors_text":"Fabiano de S. Oliveira, Valmir C. Barbosa","submitted_at":"2010-10-21T10:12:59Z","abstract_excerpt":"We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in terms of prohibiting the occurrence of directed cycles even in the most general of wait models (the so-called AND-OR model, in which prohibiting wait-for directed cycles is generally overly restrictive). For a particular case in which the priority digraphs are somewhat simplified, we introduce a Las Vegas probabilistic mechanism for resource granting and analyze its key aspects in detail."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1010.4411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-21T10:12:59Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"257e8e629c81d21a68ba0504ded5e62f306bc48f101d80c4b94a3bbaacf14744","abstract_canon_sha256":"e8c4ab87dde096c330af4f6563ea41ab41f8e96157f3ade471e83fa8734a5762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.602012Z","signature_b64":"7NzxKCAg0ZuhPi30r20ru0VfJCfJwdYX5WXLBVfy4sQzI0I1HJy4prmWREm6EHJ3IXcr/YkR6yLD9NpEi8LQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"807cfa3a6e7804fd6d4574a8118befbfa46706b6b173f47d5abb07df89eceaab","last_reissued_at":"2026-05-18T03:03:21.601509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.601509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting deadlock prevention: a probabilistic approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.DC","authors_text":"Fabiano de S. Oliveira, Valmir C. Barbosa","submitted_at":"2010-10-21T10:12:59Z","abstract_excerpt":"We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in terms of prohibiting the occurrence of directed cycles even in the most general of wait models (the so-called AND-OR model, in which prohibiting wait-for directed cycles is generally overly restrictive). For a particular case in which the priority digraphs are somewhat simplified, we introduce a Las Vegas probabilistic mechanism for resource granting and analyze its key aspects in detail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4411","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.4411","created_at":"2026-05-18T03:03:21.601590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4411v1","created_at":"2026-05-18T03:03:21.601590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4411","created_at":"2026-05-18T03:03:21.601590+00:00"},{"alias_kind":"pith_short_12","alias_value":"QB6PUOTOPACP","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QB6PUOTOPACP23KF","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QB6PUOTO","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6","json":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6.json","graph_json":"https://pith.science/api/pith-number/QB6PUOTOPACP23KFOSUBDC7PX6/graph.json","events_json":"https://pith.science/api/pith-number/QB6PUOTOPACP23KFOSUBDC7PX6/events.json","paper":"https://pith.science/paper/QB6PUOTO"},"agent_actions":{"view_html":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6","download_json":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6.json","view_paper":"https://pith.science/paper/QB6PUOTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4411&json=true","fetch_graph":"https://pith.science/api/pith-number/QB6PUOTOPACP23KFOSUBDC7PX6/graph.json","fetch_events":"https://pith.science/api/pith-number/QB6PUOTOPACP23KFOSUBDC7PX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6/action/storage_attestation","attest_author":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6/action/author_attestation","sign_citation":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6/action/citation_signature","submit_replication":"https://pith.science/pith/QB6PUOTOPACP23KFOSUBDC7PX6/action/replication_record"}},"created_at":"2026-05-18T03:03:21.601590+00:00","updated_at":"2026-05-18T03:03:21.601590+00:00"}