{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IH3ZUUDOFFH6VRME5CKCOWKZOI","short_pith_number":"pith:IH3ZUUDO","canonical_record":{"source":{"id":"1809.11060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-28T14:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"a214fef53ec35ab2a9e8f16674b45bbbe5b62bd114afd3cdf9e4bdad8110de29","abstract_canon_sha256":"e6cf7a73d3592d3fa3616fabf799fb4f0597dd280a2876b0fb91d6b101e5046b"},"schema_version":"1.0"},"canonical_sha256":"41f79a506e294feac584e8942759597224a12827e899210a19e7a29d6a50174f","source":{"kind":"arxiv","id":"1809.11060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.11060","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.11060v2","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11060","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"IH3ZUUDOFFH6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IH3ZUUDOFFH6VRME","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IH3ZUUDO","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IH3ZUUDOFFH6VRME5CKCOWKZOI","target":"record","payload":{"canonical_record":{"source":{"id":"1809.11060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-28T14:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"a214fef53ec35ab2a9e8f16674b45bbbe5b62bd114afd3cdf9e4bdad8110de29","abstract_canon_sha256":"e6cf7a73d3592d3fa3616fabf799fb4f0597dd280a2876b0fb91d6b101e5046b"},"schema_version":"1.0"},"canonical_sha256":"41f79a506e294feac584e8942759597224a12827e899210a19e7a29d6a50174f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:52.834922Z","signature_b64":"5kAKQgTX54lI9Db+qw68g0IwG9XH9g82S1qOzo+1MXmRRjDZQDT0lxBM1JVpy5YQw6L49AhW/PC+30RBmyiODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f79a506e294feac584e8942759597224a12827e899210a19e7a29d6a50174f","last_reissued_at":"2026-05-17T23:56:52.834404Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:52.834404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.11060","source_version":2,"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-17T23:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aAdmz9FUNE3Fu6VtL/XkIOB8AitLJjlsI7Zq0LGX8kI4cijQOWBwaXgMhUuQhGsG4XvYOkAN+fmXeNTu/IOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:32:48.931018Z"},"content_sha256":"c1e787d44a70e227f0ac8884cee7145569eae66b0ea5e4167be584f05dfbe836","schema_version":"1.0","event_id":"sha256:c1e787d44a70e227f0ac8884cee7145569eae66b0ea5e4167be584f05dfbe836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IH3ZUUDOFFH6VRME5CKCOWKZOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of the Strongly Dependent Decision Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Martin Biely, Peter Robinson","submitted_at":"2018-09-28T14:35:00Z","abstract_excerpt":"We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchronous systems, we show that any algorithm that solves the SDD problem induces a set of executions that is closed with respect to the point-set topology. We also show that the SDD problem is not solvable in the asynchronous system augmented with any arbitrarily strong failure detectors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11060","kind":"arxiv","version":2},"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-17T23:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezOoqoJOYRI2v8gyHm6r4B8mHN46gsLXGZoty5GGms67wROAx04Ik+aNwnT3GSiA/zLXuEUMQgNm7kINs4E8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:32:48.931368Z"},"content_sha256":"2b8a0da96d354864c15926a1675c6e2acd2f5afc38fdb9b9da2014337f967eeb","schema_version":"1.0","event_id":"sha256:2b8a0da96d354864c15926a1675c6e2acd2f5afc38fdb9b9da2014337f967eeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI/bundle.json","state_url":"https://pith.science/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI/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-01T22:32:48Z","links":{"resolver":"https://pith.science/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI","bundle":"https://pith.science/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI/bundle.json","state":"https://pith.science/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH3ZUUDOFFH6VRME5CKCOWKZOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IH3ZUUDOFFH6VRME5CKCOWKZOI","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":"e6cf7a73d3592d3fa3616fabf799fb4f0597dd280a2876b0fb91d6b101e5046b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-28T14:35:00Z","title_canon_sha256":"a214fef53ec35ab2a9e8f16674b45bbbe5b62bd114afd3cdf9e4bdad8110de29"},"schema_version":"1.0","source":{"id":"1809.11060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.11060","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.11060v2","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11060","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"IH3ZUUDOFFH6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IH3ZUUDOFFH6VRME","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IH3ZUUDO","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:2b8a0da96d354864c15926a1675c6e2acd2f5afc38fdb9b9da2014337f967eeb","target":"graph","created_at":"2026-05-17T23:56:52Z","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":"We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchronous systems, we show that any algorithm that solves the SDD problem induces a set of executions that is closed with respect to the point-set topology. We also show that the SDD problem is not solvable in the asynchronous system augmented with any arbitrarily strong failure detectors.","authors_text":"Martin Biely, Peter Robinson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-28T14:35:00Z","title":"On the Hardness of the Strongly Dependent Decision Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11060","kind":"arxiv","version":2},"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:c1e787d44a70e227f0ac8884cee7145569eae66b0ea5e4167be584f05dfbe836","target":"record","created_at":"2026-05-17T23:56:52Z","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":"e6cf7a73d3592d3fa3616fabf799fb4f0597dd280a2876b0fb91d6b101e5046b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-28T14:35:00Z","title_canon_sha256":"a214fef53ec35ab2a9e8f16674b45bbbe5b62bd114afd3cdf9e4bdad8110de29"},"schema_version":"1.0","source":{"id":"1809.11060","kind":"arxiv","version":2}},"canonical_sha256":"41f79a506e294feac584e8942759597224a12827e899210a19e7a29d6a50174f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f79a506e294feac584e8942759597224a12827e899210a19e7a29d6a50174f","first_computed_at":"2026-05-17T23:56:52.834404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:52.834404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5kAKQgTX54lI9Db+qw68g0IwG9XH9g82S1qOzo+1MXmRRjDZQDT0lxBM1JVpy5YQw6L49AhW/PC+30RBmyiODA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:52.834922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.11060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1e787d44a70e227f0ac8884cee7145569eae66b0ea5e4167be584f05dfbe836","sha256:2b8a0da96d354864c15926a1675c6e2acd2f5afc38fdb9b9da2014337f967eeb"],"state_sha256":"8b15f85cbd9c5abc73e79d607553535aeb6bf6f1da12c89a3915978fc4af945f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuyiUlSRGQU/Bsf0qkF2dZZMaSfeam1NSNg6J/afKtfnVgixJ9V81Y8SqR3KOq9Ci9e4jtAasMSdgje5XI9sAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:32:48.933173Z","bundle_sha256":"a3b4fa27e7587f6ae9097267cea9bec94ce55bda74d2569077141235b9032671"}}