{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BSINSX5C6OHB3FN2KECJS5CUH7","short_pith_number":"pith:BSINSX5C","canonical_record":{"source":{"id":"1809.05013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"2dfe0a62397cff341a18f830adca10f13270b464ae678924c7a1a4d76980e57e","abstract_canon_sha256":"c8d8677b16084b50264b3b1cd0760f2cc0f30fc595c36b61a46e66d0d558e9ef"},"schema_version":"1.0"},"canonical_sha256":"0c90d95fa2f38e1d95ba51049974543fe6744244da5f23cab4ec6ac6d2f22f86","source":{"kind":"arxiv","id":"1809.05013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05013","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05013v1","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05013","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"BSINSX5C6OHB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSINSX5C6OHB3FN2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSINSX5C","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BSINSX5C6OHB3FN2KECJS5CUH7","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"2dfe0a62397cff341a18f830adca10f13270b464ae678924c7a1a4d76980e57e","abstract_canon_sha256":"c8d8677b16084b50264b3b1cd0760f2cc0f30fc595c36b61a46e66d0d558e9ef"},"schema_version":"1.0"},"canonical_sha256":"0c90d95fa2f38e1d95ba51049974543fe6744244da5f23cab4ec6ac6d2f22f86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:46.873451Z","signature_b64":"TW8QQYTbWl4/z4AjxbpkFgwho8h0hCJmkwcVi9qAFzqmqdx+y78oxMa/8mDfekDFJtEea0PwTvwsQm1zrX3lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c90d95fa2f38e1d95ba51049974543fe6744244da5f23cab4ec6ac6d2f22f86","last_reissued_at":"2026-05-18T00:05:46.872968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:46.872968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05013","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:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgnaQ3pYsbbaZpup2F4WGm6Brs2DZLpnYdl7iY4J2klkvrgUeSNxftGndaYxzP6JcIBwPMysh2u7bPLyJmh0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:54:18.829437Z"},"content_sha256":"c1809b16218e0957e8891949e7c79550031b1490d5999bee5dae99d5cf60a316","schema_version":"1.0","event_id":"sha256:c1809b16218e0957e8891949e7c79550031b1490d5999bee5dae99d5cf60a316"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BSINSX5C6OHB3FN2KECJS5CUH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Setzer, Christian Scheideler","submitted_at":"2018-09-13T15:35:07Z","abstract_excerpt":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-tabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [12]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all stayi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05013","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:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLuTKg0H33pdbEsPreIx6uqVvofnMcq4DXdCpmSpFR2nYdD8pVaDO1zR3O+JhgnNFMwUff1OZzSKG51+Sf9DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:54:18.830202Z"},"content_sha256":"e39079409a9cc2df9d5187dc93a6920df7e332981c35022d6ccdc670d0c9efd9","schema_version":"1.0","event_id":"sha256:e39079409a9cc2df9d5187dc93a6920df7e332981c35022d6ccdc670d0c9efd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSINSX5C6OHB3FN2KECJS5CUH7/bundle.json","state_url":"https://pith.science/pith/BSINSX5C6OHB3FN2KECJS5CUH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSINSX5C6OHB3FN2KECJS5CUH7/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-28T19:54:18Z","links":{"resolver":"https://pith.science/pith/BSINSX5C6OHB3FN2KECJS5CUH7","bundle":"https://pith.science/pith/BSINSX5C6OHB3FN2KECJS5CUH7/bundle.json","state":"https://pith.science/pith/BSINSX5C6OHB3FN2KECJS5CUH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSINSX5C6OHB3FN2KECJS5CUH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BSINSX5C6OHB3FN2KECJS5CUH7","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":"c8d8677b16084b50264b3b1cd0760f2cc0f30fc595c36b61a46e66d0d558e9ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:35:07Z","title_canon_sha256":"2dfe0a62397cff341a18f830adca10f13270b464ae678924c7a1a4d76980e57e"},"schema_version":"1.0","source":{"id":"1809.05013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05013","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05013v1","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05013","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"BSINSX5C6OHB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSINSX5C6OHB3FN2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSINSX5C","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:e39079409a9cc2df9d5187dc93a6920df7e332981c35022d6ccdc670d0c9efd9","target":"graph","created_at":"2026-05-18T00:05:46Z","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":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-tabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [12]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all stayi","authors_text":"Alexander Setzer, Christian Scheideler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:35:07Z","title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05013","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:c1809b16218e0957e8891949e7c79550031b1490d5999bee5dae99d5cf60a316","target":"record","created_at":"2026-05-18T00:05:46Z","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":"c8d8677b16084b50264b3b1cd0760f2cc0f30fc595c36b61a46e66d0d558e9ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T15:35:07Z","title_canon_sha256":"2dfe0a62397cff341a18f830adca10f13270b464ae678924c7a1a4d76980e57e"},"schema_version":"1.0","source":{"id":"1809.05013","kind":"arxiv","version":1}},"canonical_sha256":"0c90d95fa2f38e1d95ba51049974543fe6744244da5f23cab4ec6ac6d2f22f86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c90d95fa2f38e1d95ba51049974543fe6744244da5f23cab4ec6ac6d2f22f86","first_computed_at":"2026-05-18T00:05:46.872968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:46.872968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TW8QQYTbWl4/z4AjxbpkFgwho8h0hCJmkwcVi9qAFzqmqdx+y78oxMa/8mDfekDFJtEea0PwTvwsQm1zrX3lAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:46.873451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1809b16218e0957e8891949e7c79550031b1490d5999bee5dae99d5cf60a316","sha256:e39079409a9cc2df9d5187dc93a6920df7e332981c35022d6ccdc670d0c9efd9"],"state_sha256":"b9d0453c6808b5e0343fe0f7c3bd05dd3f280ebb5e63cfb603efc1a9aa4f685b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxTRaGip8+nSt/XAAHiUPSXwbGYEh+mxQP06j5WnaGpxpGg67RBv27aI6A1Q2zsr+ndawrrJZAKsTbg+XAzICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:54:18.834166Z","bundle_sha256":"6495dad549883ddaa0c8af9d08bd4f2980f9afa75eadc1112d33913978c13668"}}