{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:33Q3HXKJ3MNEZTVUHM33Z7IKCC","short_pith_number":"pith:33Q3HXKJ","schema_version":"1.0","canonical_sha256":"dee1b3dd49db1a4cceb43b37bcfd0a109acaa333cc4f91018fa84d984af77558","source":{"kind":"arxiv","id":"1306.1692","version":1},"attestation_state":"computed","paper":{"title":"A DeterministicWorst-Case Message Complexity Optimal Solution for Resource Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Koutsopoulos, Christian Scheideler, Sebastian Kniesburges","submitted_at":"2013-06-07T11:23:40Z","abstract_excerpt":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(n log n)) a node receives or "},"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":"1306.1692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-07T11:23:40Z","cross_cats_sorted":[],"title_canon_sha256":"7f2709b68524be267fd8ed6b024a84509c440335d79e04891ff65300cd634a8b","abstract_canon_sha256":"0bac31e2c7ac769124e3c83e370a346311aa3bcf1432fb7941a8fc7b338dbf10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:32.663404Z","signature_b64":"mdgvDRQz70V0OKAJ3+SesXg8SyyHd1F6a/7CvOJtm4/EBzjEIoPGLNvuSog3TjO0GSXHujDYQgFwuUkwqLYBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee1b3dd49db1a4cceb43b37bcfd0a109acaa333cc4f91018fa84d984af77558","last_reissued_at":"2026-05-18T03:21:32.662899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:32.662899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A DeterministicWorst-Case Message Complexity Optimal Solution for Resource Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andreas Koutsopoulos, Christian Scheideler, Sebastian Kniesburges","submitted_at":"2013-06-07T11:23:40Z","abstract_excerpt":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(n log n)) a node receives or "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1692","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":"1306.1692","created_at":"2026-05-18T03:21:32.662974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1692v1","created_at":"2026-05-18T03:21:32.662974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1692","created_at":"2026-05-18T03:21:32.662974+00:00"},{"alias_kind":"pith_short_12","alias_value":"33Q3HXKJ3MNE","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"33Q3HXKJ3MNEZTVU","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"33Q3HXKJ","created_at":"2026-05-18T12:27:32.513160+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/33Q3HXKJ3MNEZTVUHM33Z7IKCC","json":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC.json","graph_json":"https://pith.science/api/pith-number/33Q3HXKJ3MNEZTVUHM33Z7IKCC/graph.json","events_json":"https://pith.science/api/pith-number/33Q3HXKJ3MNEZTVUHM33Z7IKCC/events.json","paper":"https://pith.science/paper/33Q3HXKJ"},"agent_actions":{"view_html":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC","download_json":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC.json","view_paper":"https://pith.science/paper/33Q3HXKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1692&json=true","fetch_graph":"https://pith.science/api/pith-number/33Q3HXKJ3MNEZTVUHM33Z7IKCC/graph.json","fetch_events":"https://pith.science/api/pith-number/33Q3HXKJ3MNEZTVUHM33Z7IKCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC/action/storage_attestation","attest_author":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC/action/author_attestation","sign_citation":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC/action/citation_signature","submit_replication":"https://pith.science/pith/33Q3HXKJ3MNEZTVUHM33Z7IKCC/action/replication_record"}},"created_at":"2026-05-18T03:21:32.662974+00:00","updated_at":"2026-05-18T03:21:32.662974+00:00"}