{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5MTJUINUPQCTOQNH7EZ5LCMDZ5","short_pith_number":"pith:5MTJUINU","canonical_record":{"source":{"id":"1710.01990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-03T19:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"facb5f4d7e76ff9a1f22c862e0ccf4ec6bf68f81dd3e0e0364208009209ad6e7","abstract_canon_sha256":"4cea17e5c6f670eef1fff7089cf88193e00b88ae3a232b76d9419dbc30086b64"},"schema_version":"1.0"},"canonical_sha256":"eb269a21b47c053741a7f933d58983cf4f262b710496e62d7acbb717946cd24c","source":{"kind":"arxiv","id":"1710.01990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01990","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01990v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01990","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"5MTJUINUPQCT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5MTJUINUPQCTOQNH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5MTJUINU","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5MTJUINUPQCTOQNH7EZ5LCMDZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-03T19:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"facb5f4d7e76ff9a1f22c862e0ccf4ec6bf68f81dd3e0e0364208009209ad6e7","abstract_canon_sha256":"4cea17e5c6f670eef1fff7089cf88193e00b88ae3a232b76d9419dbc30086b64"},"schema_version":"1.0"},"canonical_sha256":"eb269a21b47c053741a7f933d58983cf4f262b710496e62d7acbb717946cd24c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:37.865452Z","signature_b64":"t14ooJDum6hHA08GMnUZ8cbyo/C77lXlKe37hZv69YkmixxhhFjW8bId0ss7HSgEAd5KLKqCnoPwo3wXUQvNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb269a21b47c053741a7f933d58983cf4f262b710496e62d7acbb717946cd24c","last_reissued_at":"2026-05-18T00:33:37.864568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:37.864568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01990","source_version":1,"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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsfQSUpxW51C+TLC0X0bIGyUyI/xd/NcMiOItMnMEDZ/2ihSNrhRAvzYn2wLnOD82hQd8uRxP1ODUI/sZzkKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:40:38.179188Z"},"content_sha256":"d733251d33afb2b5f964114620a16646c137d71efb80ed1dc617062e1bff4048","schema_version":"1.0","event_id":"sha256:d733251d33afb2b5f964114620a16646c137d71efb80ed1dc617062e1bff4048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5MTJUINUPQCTOQNH7EZ5LCMDZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"r-Robustness and (r,s)-Robustness of Circulant Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, James Usevitch","submitted_at":"2017-10-03T19:10:30Z","abstract_excerpt":"There has been recent growing interest in graph theoretical properties known as r- and (r,s)-robustness. These properties serve as sufficient conditions guaranteeing the success of certain consensus algorithms in networks with misbehaving agents present. Due to the complexity of determining the robustness for an arbitrary graph, several methods have previously been proposed for identifying the robustness of specific classes of graphs or constructing graphs with specified robustness levels. The majority of such approaches have focused on undirected graphs. In this paper we identify a class of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01990","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"},"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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FC/d+vNrSpxJdlR2qNJSrJ+28JZkjrprDfZhaR+1pyS55/2hoObLAv+t9FoLg6kyulqJvgFQf/P4FmV2BStJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:40:38.179965Z"},"content_sha256":"1a88ddaa528c2b3c77227920f490cb4a28c609cc2d3a4712196cc3640ca914dd","schema_version":"1.0","event_id":"sha256:1a88ddaa528c2b3c77227920f490cb4a28c609cc2d3a4712196cc3640ca914dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5/bundle.json","state_url":"https://pith.science/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5/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-11T06:40:38Z","links":{"resolver":"https://pith.science/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5","bundle":"https://pith.science/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5/bundle.json","state":"https://pith.science/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MTJUINUPQCTOQNH7EZ5LCMDZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5MTJUINUPQCTOQNH7EZ5LCMDZ5","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":"4cea17e5c6f670eef1fff7089cf88193e00b88ae3a232b76d9419dbc30086b64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-03T19:10:30Z","title_canon_sha256":"facb5f4d7e76ff9a1f22c862e0ccf4ec6bf68f81dd3e0e0364208009209ad6e7"},"schema_version":"1.0","source":{"id":"1710.01990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01990","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01990v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01990","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"5MTJUINUPQCT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5MTJUINUPQCTOQNH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5MTJUINU","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:1a88ddaa528c2b3c77227920f490cb4a28c609cc2d3a4712196cc3640ca914dd","target":"graph","created_at":"2026-05-18T00:33:37Z","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":"There has been recent growing interest in graph theoretical properties known as r- and (r,s)-robustness. These properties serve as sufficient conditions guaranteeing the success of certain consensus algorithms in networks with misbehaving agents present. Due to the complexity of determining the robustness for an arbitrary graph, several methods have previously been proposed for identifying the robustness of specific classes of graphs or constructing graphs with specified robustness levels. The majority of such approaches have focused on undirected graphs. In this paper we identify a class of s","authors_text":"Dimitra Panagou, James Usevitch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-03T19:10:30Z","title":"r-Robustness and (r,s)-Robustness of Circulant Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01990","kind":"arxiv","version":1},"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:d733251d33afb2b5f964114620a16646c137d71efb80ed1dc617062e1bff4048","target":"record","created_at":"2026-05-18T00:33:37Z","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":"4cea17e5c6f670eef1fff7089cf88193e00b88ae3a232b76d9419dbc30086b64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-03T19:10:30Z","title_canon_sha256":"facb5f4d7e76ff9a1f22c862e0ccf4ec6bf68f81dd3e0e0364208009209ad6e7"},"schema_version":"1.0","source":{"id":"1710.01990","kind":"arxiv","version":1}},"canonical_sha256":"eb269a21b47c053741a7f933d58983cf4f262b710496e62d7acbb717946cd24c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb269a21b47c053741a7f933d58983cf4f262b710496e62d7acbb717946cd24c","first_computed_at":"2026-05-18T00:33:37.864568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:37.864568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t14ooJDum6hHA08GMnUZ8cbyo/C77lXlKe37hZv69YkmixxhhFjW8bId0ss7HSgEAd5KLKqCnoPwo3wXUQvNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:37.865452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d733251d33afb2b5f964114620a16646c137d71efb80ed1dc617062e1bff4048","sha256:1a88ddaa528c2b3c77227920f490cb4a28c609cc2d3a4712196cc3640ca914dd"],"state_sha256":"ce1bd6c0a6b8f1bc172e49254a99ff9450fa6cb327994d315e97ddb7839b7fc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VliqlrU9zfO6hFqPDEZFLO/cE4acc8l60YlJhKjGWydaWD84X/FmFsSnUsF1trXxa/yleaSHc+p7t4ehrz4JBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:40:38.184508Z","bundle_sha256":"4361c6baf4138170bb22fc1fa748a5435b9d88a3de61c5c241d29bc425493e39"}}