{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D6E6H7LLQVLX3GQ6EBIXF62WUL","short_pith_number":"pith:D6E6H7LL","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"},"canonical_sha256":"1f89e3fd6b85577d9a1e205172fb56a2c0aff166aeb2ec80ee88d5bee938923a","source":{"kind":"arxiv","id":"1708.06542","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06542","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06542v2","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06542","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"D6E6H7LLQVLX","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D6E6H7LLQVLX3GQ6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D6E6H7LL","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D6E6H7LLQVLX3GQ6EBIXF62WUL","target":"record","payload":{"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"},"canonical_sha256":"1f89e3fd6b85577d9a1e205172fb56a2c0aff166aeb2ec80ee88d5bee938923a","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"},"source_kind":"arxiv","source_id":"1708.06542","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-18T00:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJWiM2aTnUJPOIQVIVo8IJ1uTqwRUwPxcjiHcDF+h8z2NY7CReCJOILbFrAoliDVxdvskkJBN4C00q6+AGxvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:12:49.647327Z"},"content_sha256":"ec7abd3e9d549ad6b9f54b42cf736304380ffb6ef8f6287f7ad25eac3ddeb4c8","schema_version":"1.0","event_id":"sha256:ec7abd3e9d549ad6b9f54b42cf736304380ffb6ef8f6287f7ad25eac3ddeb4c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D6E6H7LLQVLX3GQ6EBIXF62WUL","target":"graph","payload":{"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"},"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:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vNOgb5RSwP753UchOA/h3H1MGXoorGmd8rY8bJnuKiU8qx/frbUI3zXifVWVAaDUQCMcV8ziYbU6X7yA6inXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:12:49.647669Z"},"content_sha256":"9887e259d1b4d8616a1ad974874e105186e8a54bd838542ef16882cc414eff56","schema_version":"1.0","event_id":"sha256:9887e259d1b4d8616a1ad974874e105186e8a54bd838542ef16882cc414eff56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/bundle.json","state_url":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/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-01T15:12:49Z","links":{"resolver":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL","bundle":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/bundle.json","state":"https://pith.science/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6E6H7LLQVLX3GQ6EBIXF62WUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D6E6H7LLQVLX3GQ6EBIXF62WUL","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":"ce839c3ad4c5a9a64750bd852ad72c6d57ff21509f0263bc913136e0b367bb01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-22T08:59:47Z","title_canon_sha256":"d7fbc87bd8f785629c55fe5ab846c8574c755c825bed84b0f85d3cf476331e84"},"schema_version":"1.0","source":{"id":"1708.06542","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06542","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06542v2","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06542","created_at":"2026-05-18T00:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"D6E6H7LLQVLX","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D6E6H7LLQVLX3GQ6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D6E6H7LL","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:9887e259d1b4d8616a1ad974874e105186e8a54bd838542ef16882cc414eff56","target":"graph","created_at":"2026-05-18T00:27:57Z","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":"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","authors_text":"Christian Scheideler, Michael Feldmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-22T08:59:47Z","title":"A Self-Stabilizing General De Bruijn Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06542","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:ec7abd3e9d549ad6b9f54b42cf736304380ffb6ef8f6287f7ad25eac3ddeb4c8","target":"record","created_at":"2026-05-18T00:27:57Z","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":"ce839c3ad4c5a9a64750bd852ad72c6d57ff21509f0263bc913136e0b367bb01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-22T08:59:47Z","title_canon_sha256":"d7fbc87bd8f785629c55fe5ab846c8574c755c825bed84b0f85d3cf476331e84"},"schema_version":"1.0","source":{"id":"1708.06542","kind":"arxiv","version":2}},"canonical_sha256":"1f89e3fd6b85577d9a1e205172fb56a2c0aff166aeb2ec80ee88d5bee938923a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f89e3fd6b85577d9a1e205172fb56a2c0aff166aeb2ec80ee88d5bee938923a","first_computed_at":"2026-05-18T00:27:57.084234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:57.084234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZfGv9Uk41JK5U0k4eOSRP5AizVPtwvXyANVkMkD3PuJKZ8fVGySvV/6iWvGq086BqWLTu/Ey1Lbpguwm3dBGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:57.084850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06542","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec7abd3e9d549ad6b9f54b42cf736304380ffb6ef8f6287f7ad25eac3ddeb4c8","sha256:9887e259d1b4d8616a1ad974874e105186e8a54bd838542ef16882cc414eff56"],"state_sha256":"b544a009704f579b22406419ffe29f322f8512268bcbd6e8d838a606582d8ea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cW1pH5+U8s/YOFtpSJwC6uqIm0cDrjb4iQ/QWq0nEqxer3zQ5EMd5etcSj72lRqfFni+UVNvpABASplc6j8ECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:12:49.649517Z","bundle_sha256":"1b0687a9e2685963a9e2da645cd6b1baf402c8d793edac55e8cc9a0fd7e00bcd"}}