{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ACJCFJS6RNBDWVESBLZDD2IZA7","short_pith_number":"pith:ACJCFJS6","canonical_record":{"source":{"id":"1311.0244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-11-01T18:16:01Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"55f748d9d8f0e3e35ff9b7d954545ba4a1898d2176d2ae8d2edf4013b4d9656f","abstract_canon_sha256":"e5f06c82889ef45a7cab2b3a73a6b2e99168c05caad7e86bd4073bcd551f74bd"},"schema_version":"1.0"},"canonical_sha256":"009222a65e8b423b54920af231e91907f106d7e4dc4ab3e12c674703c1a78f12","source":{"kind":"arxiv","id":"1311.0244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0244","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0244v1","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0244","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"ACJCFJS6RNBD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACJCFJS6RNBDWVES","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACJCFJS6","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ACJCFJS6RNBDWVESBLZDD2IZA7","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-11-01T18:16:01Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"55f748d9d8f0e3e35ff9b7d954545ba4a1898d2176d2ae8d2edf4013b4d9656f","abstract_canon_sha256":"e5f06c82889ef45a7cab2b3a73a6b2e99168c05caad7e86bd4073bcd551f74bd"},"schema_version":"1.0"},"canonical_sha256":"009222a65e8b423b54920af231e91907f106d7e4dc4ab3e12c674703c1a78f12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:04.571084Z","signature_b64":"MoSJ/WU2TDlMBMBEzgZrOyoB2oEVI41stFL4Ymap2sJatfabH6wTAk4bq//b4NmuKo76Rrm6h34ABYIKnHCpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009222a65e8b423b54920af231e91907f106d7e4dc4ab3e12c674703c1a78f12","last_reissued_at":"2026-05-18T01:23:04.570647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:04.570647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0244","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-18T01:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"izrHlI13OJzICMMvcMLCoa6Z0/R4G0dnR9fq9I0x9awnVPYjOP2dZWtD2YOlv2znguf0+Ac+bEYJyWFC78uLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:10:59.403897Z"},"content_sha256":"6934f0afba584054d7bf3ec755d8e5a98777a536565277aad7bd287bc0292850","schema_version":"1.0","event_id":"sha256:6934f0afba584054d7bf3ec755d8e5a98777a536565277aad7bd287bc0292850"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ACJCFJS6RNBDWVESBLZDD2IZA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Message Passing Strategy for Decentralized Connectivity Maintenance in Agent Removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"A. Yasin Yazicioglu, Derya Aksaray, Dimitri N. Mavris, Eric Feron","submitted_at":"2013-11-01T18:16:01Z","abstract_excerpt":"In a multi-agent system, agents coordinate to achieve global tasks through local communications. Coordination usually requires sufficient information flow, which is usually depicted by the connectivity of the communication network. In a networked system, removal of some agents may cause a disconnection. In order to maintain connectivity in agent removal, one can design a robust network topology that tolerates a finite number of agent losses, and/or develop a control strategy that recovers connectivity. This paper proposes a decentralized control scheme based on a sequence of replacements, each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0244","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-18T01:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFecgqxWaw4D2HIFnuwW47PZzGfHgxVm3qZ6Nszs7Q/axtZVQ/+38wzcfKGaTqFAKf3Bi3jOjGFxx2cnYLDKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:10:59.404238Z"},"content_sha256":"4e18ea7263cc2d1832a7a1b3864815bf1a29f77a177abe63e1be8d59e6aa8dbf","schema_version":"1.0","event_id":"sha256:4e18ea7263cc2d1832a7a1b3864815bf1a29f77a177abe63e1be8d59e6aa8dbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACJCFJS6RNBDWVESBLZDD2IZA7/bundle.json","state_url":"https://pith.science/pith/ACJCFJS6RNBDWVESBLZDD2IZA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACJCFJS6RNBDWVESBLZDD2IZA7/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-05T12:10:59Z","links":{"resolver":"https://pith.science/pith/ACJCFJS6RNBDWVESBLZDD2IZA7","bundle":"https://pith.science/pith/ACJCFJS6RNBDWVESBLZDD2IZA7/bundle.json","state":"https://pith.science/pith/ACJCFJS6RNBDWVESBLZDD2IZA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACJCFJS6RNBDWVESBLZDD2IZA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ACJCFJS6RNBDWVESBLZDD2IZA7","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":"e5f06c82889ef45a7cab2b3a73a6b2e99168c05caad7e86bd4073bcd551f74bd","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-11-01T18:16:01Z","title_canon_sha256":"55f748d9d8f0e3e35ff9b7d954545ba4a1898d2176d2ae8d2edf4013b4d9656f"},"schema_version":"1.0","source":{"id":"1311.0244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0244","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0244v1","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0244","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"ACJCFJS6RNBD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACJCFJS6RNBDWVES","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACJCFJS6","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:4e18ea7263cc2d1832a7a1b3864815bf1a29f77a177abe63e1be8d59e6aa8dbf","target":"graph","created_at":"2026-05-18T01:23:04Z","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":"In a multi-agent system, agents coordinate to achieve global tasks through local communications. Coordination usually requires sufficient information flow, which is usually depicted by the connectivity of the communication network. In a networked system, removal of some agents may cause a disconnection. In order to maintain connectivity in agent removal, one can design a robust network topology that tolerates a finite number of agent losses, and/or develop a control strategy that recovers connectivity. This paper proposes a decentralized control scheme based on a sequence of replacements, each","authors_text":"A. Yasin Yazicioglu, Derya Aksaray, Dimitri N. Mavris, Eric Feron","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-11-01T18:16:01Z","title":"A Message Passing Strategy for Decentralized Connectivity Maintenance in Agent Removal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0244","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:6934f0afba584054d7bf3ec755d8e5a98777a536565277aad7bd287bc0292850","target":"record","created_at":"2026-05-18T01:23:04Z","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":"e5f06c82889ef45a7cab2b3a73a6b2e99168c05caad7e86bd4073bcd551f74bd","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-11-01T18:16:01Z","title_canon_sha256":"55f748d9d8f0e3e35ff9b7d954545ba4a1898d2176d2ae8d2edf4013b4d9656f"},"schema_version":"1.0","source":{"id":"1311.0244","kind":"arxiv","version":1}},"canonical_sha256":"009222a65e8b423b54920af231e91907f106d7e4dc4ab3e12c674703c1a78f12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"009222a65e8b423b54920af231e91907f106d7e4dc4ab3e12c674703c1a78f12","first_computed_at":"2026-05-18T01:23:04.570647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:04.570647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MoSJ/WU2TDlMBMBEzgZrOyoB2oEVI41stFL4Ymap2sJatfabH6wTAk4bq//b4NmuKo76Rrm6h34ABYIKnHCpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:04.571084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6934f0afba584054d7bf3ec755d8e5a98777a536565277aad7bd287bc0292850","sha256:4e18ea7263cc2d1832a7a1b3864815bf1a29f77a177abe63e1be8d59e6aa8dbf"],"state_sha256":"018523fbae40ab6e78e506bbeeec2517b7b402ee91b4f01108a8f378c2e66404"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Sa2JZRrsA0ghtR8kv0Txkce04+tdv5qL4qpPKxY6KZdkclQMut7f8Gom3OoZXhCxsojMcsyOcnzq/dLJRb5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:10:59.406261Z","bundle_sha256":"2bd96a56f4e584f6e0b9481cb7bab96d799ff6d8824e2f2dacebd2600172736f"}}