{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SBXHM7NKAMHXPKMMYZCUKYDYQR","short_pith_number":"pith:SBXHM7NK","schema_version":"1.0","canonical_sha256":"906e767daa030f77a98cc64545607884753954376afdb2efec6f02294074da42","source":{"kind":"arxiv","id":"1103.5678","version":1},"attestation_state":"computed","paper":{"title":"Converging an Overlay Network to a Gradient Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Amir Payberah, Ather Gattami, Guodong Shi, H{\\aa}kan Terelius, Jim Dowling, Karl Henrik Johansson","submitted_at":"2011-03-29T15:12:40Z","abstract_excerpt":"In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gradient overlay network is characterized by the properties that each node has a set of neighbors with the same utility value (a similar view) and a set of neighbors containing higher utility values (gradient neighbor set), such that paths of increasing utilities emerge in the network topology. The Gradient overlay network is built using gossiping and a preference function that samples from nodes using a uniform random "},"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":"1103.5678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-03-29T15:12:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"38008c459f6e9a8b381ab0aadf8c778903c02ca6646ae5bf8dfe7add9f298938","abstract_canon_sha256":"de204d964d492232c2f6d01cb482e1b7b0b65a0889f3190cc74cef7cdcae6b82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.011195Z","signature_b64":"3jMNPnPiw/3hrEJ5ipEcbq9ZabGjVBel84eO7PjfJyXAlRF9Q4ndlCCTyYvq9paUvQaYOSBng58RDdTxGp19AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906e767daa030f77a98cc64545607884753954376afdb2efec6f02294074da42","last_reissued_at":"2026-05-18T00:58:19.010398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.010398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Converging an Overlay Network to a Gradient Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Amir Payberah, Ather Gattami, Guodong Shi, H{\\aa}kan Terelius, Jim Dowling, Karl Henrik Johansson","submitted_at":"2011-03-29T15:12:40Z","abstract_excerpt":"In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gradient overlay network is characterized by the properties that each node has a set of neighbors with the same utility value (a similar view) and a set of neighbors containing higher utility values (gradient neighbor set), such that paths of increasing utilities emerge in the network topology. The Gradient overlay network is built using gossiping and a preference function that samples from nodes using a uniform random "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5678","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":"1103.5678","created_at":"2026-05-18T00:58:19.010540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5678v1","created_at":"2026-05-18T00:58:19.010540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5678","created_at":"2026-05-18T00:58:19.010540+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBXHM7NKAMHX","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBXHM7NKAMHXPKMM","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBXHM7NK","created_at":"2026-05-18T12:26:41.206345+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/SBXHM7NKAMHXPKMMYZCUKYDYQR","json":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR.json","graph_json":"https://pith.science/api/pith-number/SBXHM7NKAMHXPKMMYZCUKYDYQR/graph.json","events_json":"https://pith.science/api/pith-number/SBXHM7NKAMHXPKMMYZCUKYDYQR/events.json","paper":"https://pith.science/paper/SBXHM7NK"},"agent_actions":{"view_html":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR","download_json":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR.json","view_paper":"https://pith.science/paper/SBXHM7NK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5678&json=true","fetch_graph":"https://pith.science/api/pith-number/SBXHM7NKAMHXPKMMYZCUKYDYQR/graph.json","fetch_events":"https://pith.science/api/pith-number/SBXHM7NKAMHXPKMMYZCUKYDYQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR/action/storage_attestation","attest_author":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR/action/author_attestation","sign_citation":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR/action/citation_signature","submit_replication":"https://pith.science/pith/SBXHM7NKAMHXPKMMYZCUKYDYQR/action/replication_record"}},"created_at":"2026-05-18T00:58:19.010540+00:00","updated_at":"2026-05-18T00:58:19.010540+00:00"}