{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J6ANS6RWJEWNJK63Q5RODQ6KSH","short_pith_number":"pith:J6ANS6RW","schema_version":"1.0","canonical_sha256":"4f80d97a36492cd4abdb8762e1c3ca91c74b0eb6cdd8f777a5654c7e5952912b","source":{"kind":"arxiv","id":"1810.01784","version":2},"attestation_state":"computed","paper":{"title":"Determining r-Robustness of Digraphs Using Mixed Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, James Usevitch","submitted_at":"2018-10-02T03:52:05Z","abstract_excerpt":"Convergence guarantees of many resilient consensus algorithms are based on the graph theoretic properties of $r$- and $(r,s)$-robustness. These algorithms guarantee consensus of normally behaving agents in the presence of a bounded number of arbitrarily misbehaving agents if the values of the integers $r$ and $s$ are sufficiently high. However, determining the largest integer $r$ for which an arbitrary digraph is $r$-robust is highly nontrivial. This paper introduces a novel method for calculating this value using mixed integer linear programming. The method only requires knowledge of the grap"},"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":"1810.01784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-02T03:52:05Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"06b3f8029f936b5eba4a5632457969f6f433684aa6b550f32c0b6576758461c7","abstract_canon_sha256":"95aabe18b79e15ce6091086111ca8107827e9253794fc92ffa5a16c407a6d447"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.672653Z","signature_b64":"ho00fvIHXRlHursQBnJg11l7lErE/su1Ti6COWWzkJ2U7gDlKBCzezBrhxFRhVyWqR8kV7Z+KlUPVXASj5+sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f80d97a36492cd4abdb8762e1c3ca91c74b0eb6cdd8f777a5654c7e5952912b","last_reissued_at":"2026-05-17T23:42:53.672036Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.672036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determining r-Robustness of Digraphs Using Mixed Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, James Usevitch","submitted_at":"2018-10-02T03:52:05Z","abstract_excerpt":"Convergence guarantees of many resilient consensus algorithms are based on the graph theoretic properties of $r$- and $(r,s)$-robustness. These algorithms guarantee consensus of normally behaving agents in the presence of a bounded number of arbitrarily misbehaving agents if the values of the integers $r$ and $s$ are sufficiently high. However, determining the largest integer $r$ for which an arbitrary digraph is $r$-robust is highly nontrivial. This paper introduces a novel method for calculating this value using mixed integer linear programming. The method only requires knowledge of the grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01784","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":"1810.01784","created_at":"2026-05-17T23:42:53.672130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01784v2","created_at":"2026-05-17T23:42:53.672130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01784","created_at":"2026-05-17T23:42:53.672130+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6ANS6RWJEWN","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6ANS6RWJEWNJK63","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6ANS6RW","created_at":"2026-05-18T12:32:31.084164+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/J6ANS6RWJEWNJK63Q5RODQ6KSH","json":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH.json","graph_json":"https://pith.science/api/pith-number/J6ANS6RWJEWNJK63Q5RODQ6KSH/graph.json","events_json":"https://pith.science/api/pith-number/J6ANS6RWJEWNJK63Q5RODQ6KSH/events.json","paper":"https://pith.science/paper/J6ANS6RW"},"agent_actions":{"view_html":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH","download_json":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH.json","view_paper":"https://pith.science/paper/J6ANS6RW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01784&json=true","fetch_graph":"https://pith.science/api/pith-number/J6ANS6RWJEWNJK63Q5RODQ6KSH/graph.json","fetch_events":"https://pith.science/api/pith-number/J6ANS6RWJEWNJK63Q5RODQ6KSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH/action/storage_attestation","attest_author":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH/action/author_attestation","sign_citation":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH/action/citation_signature","submit_replication":"https://pith.science/pith/J6ANS6RWJEWNJK63Q5RODQ6KSH/action/replication_record"}},"created_at":"2026-05-17T23:42:53.672130+00:00","updated_at":"2026-05-17T23:42:53.672130+00:00"}