{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AWRD7NQB6TMLNVPHR6ERN6DPCU","short_pith_number":"pith:AWRD7NQB","schema_version":"1.0","canonical_sha256":"05a23fb601f4d8b6d5e78f8916f86f1516a65cf17537bfb08e95f1363294fdac","source":{"kind":"arxiv","id":"1512.06593","version":1},"attestation_state":"computed","paper":{"title":"Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures (full version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Setzer, Christian Scheideler, Thim Strothmann","submitted_at":"2015-12-21T12:05:10Z","abstract_excerpt":"Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are"},"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":"1512.06593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-21T12:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"b8f408203d83480d60438e4217fe56b8c0ff7e6dd67ea789caf4ab1e1fd0df06","abstract_canon_sha256":"8427f7dd6acd3fb3d43592899af3784285b286f5a398a772320fd828e3cc1df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:00.108436Z","signature_b64":"cguQoJpmJh7Na5L6jE89tbvY5UJegGPwZAJiVgmDzZrDHwraD6fiwt5isaLmQBHehvybMATW5a86ohX1jFfxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a23fb601f4d8b6d5e78f8916f86f1516a65cf17537bfb08e95f1363294fdac","last_reissued_at":"2026-05-18T01:24:00.107959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:00.107959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures (full version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Setzer, Christian Scheideler, Thim Strothmann","submitted_at":"2015-12-21T12:05:10Z","abstract_excerpt":"Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06593","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":"1512.06593","created_at":"2026-05-18T01:24:00.108018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06593v1","created_at":"2026-05-18T01:24:00.108018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06593","created_at":"2026-05-18T01:24:00.108018+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWRD7NQB6TML","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWRD7NQB6TMLNVPH","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWRD7NQB","created_at":"2026-05-18T12:29:10.953037+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/AWRD7NQB6TMLNVPHR6ERN6DPCU","json":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU.json","graph_json":"https://pith.science/api/pith-number/AWRD7NQB6TMLNVPHR6ERN6DPCU/graph.json","events_json":"https://pith.science/api/pith-number/AWRD7NQB6TMLNVPHR6ERN6DPCU/events.json","paper":"https://pith.science/paper/AWRD7NQB"},"agent_actions":{"view_html":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU","download_json":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU.json","view_paper":"https://pith.science/paper/AWRD7NQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06593&json=true","fetch_graph":"https://pith.science/api/pith-number/AWRD7NQB6TMLNVPHR6ERN6DPCU/graph.json","fetch_events":"https://pith.science/api/pith-number/AWRD7NQB6TMLNVPHR6ERN6DPCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU/action/storage_attestation","attest_author":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU/action/author_attestation","sign_citation":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU/action/citation_signature","submit_replication":"https://pith.science/pith/AWRD7NQB6TMLNVPHR6ERN6DPCU/action/replication_record"}},"created_at":"2026-05-18T01:24:00.108018+00:00","updated_at":"2026-05-18T01:24:00.108018+00:00"}