{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D6E6H7LLQVLX3GQ6EBIXF62WUL","short_pith_number":"pith:D6E6H7LL","schema_version":"1.0","canonical_sha256":"1f89e3fd6b85577d9a1e205172fb56a2c0aff166aeb2ec80ee88d5bee938923a","source":{"kind":"arxiv","id":"1708.06542","version":2},"attestation_state":"computed","paper":{"title":"A Self-Stabilizing General De Bruijn Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Michael Feldmann","submitted_at":"2017-08-22T08:59:47Z","abstract_excerpt":"Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination. Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \\sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\\mathcal O(\\sqrt[d]{n})$, which is asymptotic"},"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":"1708.06542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-22T08:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"d7fbc87bd8f785629c55fe5ab846c8574c755c825bed84b0f85d3cf476331e84","abstract_canon_sha256":"ce839c3ad4c5a9a64750bd852ad72c6d57ff21509f0263bc913136e0b367bb01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:57.084850Z","signature_b64":"ZfGv9Uk41JK5U0k4eOSRP5AizVPtwvXyANVkMkD3PuJKZ8fVGySvV/6iWvGq086BqWLTu/Ey1Lbpguwm3dBGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f89e3fd6b85577d9a1e205172fb56a2c0aff166aeb2ec80ee88d5bee938923a","last_reissued_at":"2026-05-18T00:27:57.084234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:57.084234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Self-Stabilizing General De Bruijn Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Michael Feldmann","submitted_at":"2017-08-22T08:59:47Z","abstract_excerpt":"Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination. Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \\sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\\mathcal O(\\sqrt[d]{n})$, which is asymptotic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06542","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.06542","created_at":"2026-05-18T00:27:57.084329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06542v2","created_at":"2026-05-18T00:27:57.084329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06542","created_at":"2026-05-18T00:27:57.084329+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6E6H7LLQVLX","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6E6H7LLQVLX3GQ6","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6E6H7LL","created_at":"2026-05-18T12:31:10.602751+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/D6E6H7LLQVLX3GQ6EBIXF62WUL","json":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL.json","graph_json":"https://pith.science/api/pith-number/D6E6H7LLQVLX3GQ6EBIXF62WUL/graph.json","events_json":"https://pith.science/api/pith-number/D6E6H7LLQVLX3GQ6EBIXF62WUL/events.json","paper":"https://pith.science/paper/D6E6H7LL"},"agent_actions":{"view_html":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL","download_json":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL.json","view_paper":"https://pith.science/paper/D6E6H7LL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06542&json=true","fetch_graph":"https://pith.science/api/pith-number/D6E6H7LLQVLX3GQ6EBIXF62WUL/graph.json","fetch_events":"https://pith.science/api/pith-number/D6E6H7LLQVLX3GQ6EBIXF62WUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/action/storage_attestation","attest_author":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/action/author_attestation","sign_citation":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/action/citation_signature","submit_replication":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/action/replication_record"}},"created_at":"2026-05-18T00:27:57.084329+00:00","updated_at":"2026-05-18T00:27:57.084329+00:00"}