{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4FS53LY4ZABQ7CPAQPQSKNR5DY","short_pith_number":"pith:4FS53LY4","canonical_record":{"source":{"id":"1905.04106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-10T12:18:48Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"4956a12451298272a7ae9d5bfeaf47b165463e343c2fa96aa4608d487c6ff567","abstract_canon_sha256":"ad819217fdc526973d2cb52db8a034fe291d0bba136ea07c661a85ef7e82f4c0"},"schema_version":"1.0"},"canonical_sha256":"e165ddaf1cc8030f89e083e125363d1e116db12217558a41aa2d7b2fcad0f830","source":{"kind":"arxiv","id":"1905.04106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04106","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04106v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04106","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"4FS53LY4ZABQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FS53LY4ZABQ7CPA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FS53LY4","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4FS53LY4ZABQ7CPAQPQSKNR5DY","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-10T12:18:48Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"4956a12451298272a7ae9d5bfeaf47b165463e343c2fa96aa4608d487c6ff567","abstract_canon_sha256":"ad819217fdc526973d2cb52db8a034fe291d0bba136ea07c661a85ef7e82f4c0"},"schema_version":"1.0"},"canonical_sha256":"e165ddaf1cc8030f89e083e125363d1e116db12217558a41aa2d7b2fcad0f830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:34.544050Z","signature_b64":"s49Bb7lQ1wYLNjMbUkti9PaDc4n0O2r5+AWrLYD27GyQ98YrYHOB9GpJyLJ+ZoHgkDHanKGEEzMdXCiAsabcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e165ddaf1cc8030f89e083e125363d1e116db12217558a41aa2d7b2fcad0f830","last_reissued_at":"2026-05-17T23:46:34.543418Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:34.543418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04106","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-17T23:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90j2UkRjrw9R+E0H0NYrS/FlaMBlSxkdZggmopMlIk/aGrrY/A89ny7j+v/MuYW6i4bMFWr6pFgfs7/7qJbpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:02:55.984583Z"},"content_sha256":"ad690062a804f21813bea20854197b982de40c400af59f1b5be3414eccca7188","schema_version":"1.0","event_id":"sha256:ad690062a804f21813bea20854197b982de40c400af59f1b5be3414eccca7188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4FS53LY4ZABQ7CPAQPQSKNR5DY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness: a New Form of Heredity Motivated by Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Arnaud Casteigts, Franck Petit, John M. Robson, Swan Dubois","submitted_at":"2019-05-10T12:18:48Z","abstract_excerpt":"We investigate a special case of hereditary property in graphs, referred to as {\\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this definition using two different settings of dynamic networks. The first corresponds to networks of low dynamicity, where some links may be permanently removed so long as the network remains connected. The second corresponds to highly-dynamic networks, where communication links appear and disappear arbitrarily often, subject only to the requirement that the ent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04106","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-17T23:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJQvNHSPtMYKQf9xWbqaLJ6Yb3dyuZppGym8TG/whclq7FKjMyAWiNqR3pb88OX00SGFWH63UDoDXJPvb8tkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:02:55.984934Z"},"content_sha256":"1e9418c129b58bd426df9cb7a94e4924c8614fa5e5de5c0552d4d1c3b2d3d194","schema_version":"1.0","event_id":"sha256:1e9418c129b58bd426df9cb7a94e4924c8614fa5e5de5c0552d4d1c3b2d3d194"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY/bundle.json","state_url":"https://pith.science/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY/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-02T04:02:55Z","links":{"resolver":"https://pith.science/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY","bundle":"https://pith.science/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY/bundle.json","state":"https://pith.science/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FS53LY4ZABQ7CPAQPQSKNR5DY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4FS53LY4ZABQ7CPAQPQSKNR5DY","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":"ad819217fdc526973d2cb52db8a034fe291d0bba136ea07c661a85ef7e82f4c0","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-10T12:18:48Z","title_canon_sha256":"4956a12451298272a7ae9d5bfeaf47b165463e343c2fa96aa4608d487c6ff567"},"schema_version":"1.0","source":{"id":"1905.04106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04106","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04106v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04106","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"4FS53LY4ZABQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4FS53LY4ZABQ7CPA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4FS53LY4","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:1e9418c129b58bd426df9cb7a94e4924c8614fa5e5de5c0552d4d1c3b2d3d194","target":"graph","created_at":"2026-05-17T23:46:34Z","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":"We investigate a special case of hereditary property in graphs, referred to as {\\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this definition using two different settings of dynamic networks. The first corresponds to networks of low dynamicity, where some links may be permanently removed so long as the network remains connected. The second corresponds to highly-dynamic networks, where communication links appear and disappear arbitrarily often, subject only to the requirement that the ent","authors_text":"Arnaud Casteigts, Franck Petit, John M. Robson, Swan Dubois","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-10T12:18:48Z","title":"Robustness: a New Form of Heredity Motivated by Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04106","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:ad690062a804f21813bea20854197b982de40c400af59f1b5be3414eccca7188","target":"record","created_at":"2026-05-17T23:46:34Z","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":"ad819217fdc526973d2cb52db8a034fe291d0bba136ea07c661a85ef7e82f4c0","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-10T12:18:48Z","title_canon_sha256":"4956a12451298272a7ae9d5bfeaf47b165463e343c2fa96aa4608d487c6ff567"},"schema_version":"1.0","source":{"id":"1905.04106","kind":"arxiv","version":1}},"canonical_sha256":"e165ddaf1cc8030f89e083e125363d1e116db12217558a41aa2d7b2fcad0f830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e165ddaf1cc8030f89e083e125363d1e116db12217558a41aa2d7b2fcad0f830","first_computed_at":"2026-05-17T23:46:34.543418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:34.543418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s49Bb7lQ1wYLNjMbUkti9PaDc4n0O2r5+AWrLYD27GyQ98YrYHOB9GpJyLJ+ZoHgkDHanKGEEzMdXCiAsabcCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:34.544050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad690062a804f21813bea20854197b982de40c400af59f1b5be3414eccca7188","sha256:1e9418c129b58bd426df9cb7a94e4924c8614fa5e5de5c0552d4d1c3b2d3d194"],"state_sha256":"e0fcf0a9e3e0b9819ed749aa855b6303f4e52c3265109ebc0bf6fa66d9a16883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3leonnRdb0OAaz91CE4FJXPuXFwxG9fLQwulvVgfOqecKT5mvuRoSXfFVcEjFoQNcRHlnk/t5vTKDeE6vg79Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:02:55.986927Z","bundle_sha256":"132ac4a826a3236543ed06ee27b4c46e2e931d0a0999f7a2d62ac0b43cfe5e69"}}