{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SD6LI6IMOOXHTG5CZ6UL7BRZU3","short_pith_number":"pith:SD6LI6IM","schema_version":"1.0","canonical_sha256":"90fcb4790c73ae799ba2cfa8bf8639a6d84ef13c08403c50db25eea6d5422a99","source":{"kind":"arxiv","id":"1703.03190","version":1},"attestation_state":"computed","paper":{"title":"Robustness in Highly Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts, Franck Petit, John Michael Robson, Swan Dubois","submitted_at":"2017-03-09T09:26:05Z","abstract_excerpt":"We investigate a special case of hereditary property that we refer to as {\\em robustness}. A property is {\\em robust} in a given graph if it is inherited by all connected spanning subgraphs of this graph. We motivate this definition in different contexts, showing that it plays a central role in highly dynamic networks, although the problem is defined in terms of classical (static) graph theory. In this paper, we focus on the robustness of {\\em maximal independent sets} (MIS). Following the above definition, a MIS is said to be {\\em robust} (RMIS) if it remains a valid MIS in all connected span"},"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":"1703.03190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-09T09:26:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b37df699d91d3dfce711e885b648c43cd8523d11281a11fd29d758f614c81bb8","abstract_canon_sha256":"6cdee15ba0fec0881cc7d290f708f104e3dfd4084e04792c43335bf61e031eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:01.185001Z","signature_b64":"4MypbGz1jQeNCXZDRQhOdeHQaUX7HyuURussZO4U06D3+Z7gThOpoc/uL1dtIIp/CIC+AMxoAOGvHYwVPRVxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90fcb4790c73ae799ba2cfa8bf8639a6d84ef13c08403c50db25eea6d5422a99","last_reissued_at":"2026-05-18T00:49:01.184517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:01.184517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness in Highly Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts, Franck Petit, John Michael Robson, Swan Dubois","submitted_at":"2017-03-09T09:26:05Z","abstract_excerpt":"We investigate a special case of hereditary property that we refer to as {\\em robustness}. A property is {\\em robust} in a given graph if it is inherited by all connected spanning subgraphs of this graph. We motivate this definition in different contexts, showing that it plays a central role in highly dynamic networks, although the problem is defined in terms of classical (static) graph theory. In this paper, we focus on the robustness of {\\em maximal independent sets} (MIS). Following the above definition, a MIS is said to be {\\em robust} (RMIS) if it remains a valid MIS in all connected span"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03190","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":"1703.03190","created_at":"2026-05-18T00:49:01.184593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03190v1","created_at":"2026-05-18T00:49:01.184593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03190","created_at":"2026-05-18T00:49:01.184593+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD6LI6IMOOXH","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD6LI6IMOOXHTG5C","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD6LI6IM","created_at":"2026-05-18T12:31:43.269735+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/SD6LI6IMOOXHTG5CZ6UL7BRZU3","json":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3.json","graph_json":"https://pith.science/api/pith-number/SD6LI6IMOOXHTG5CZ6UL7BRZU3/graph.json","events_json":"https://pith.science/api/pith-number/SD6LI6IMOOXHTG5CZ6UL7BRZU3/events.json","paper":"https://pith.science/paper/SD6LI6IM"},"agent_actions":{"view_html":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3","download_json":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3.json","view_paper":"https://pith.science/paper/SD6LI6IM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03190&json=true","fetch_graph":"https://pith.science/api/pith-number/SD6LI6IMOOXHTG5CZ6UL7BRZU3/graph.json","fetch_events":"https://pith.science/api/pith-number/SD6LI6IMOOXHTG5CZ6UL7BRZU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3/action/storage_attestation","attest_author":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3/action/author_attestation","sign_citation":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3/action/citation_signature","submit_replication":"https://pith.science/pith/SD6LI6IMOOXHTG5CZ6UL7BRZU3/action/replication_record"}},"created_at":"2026-05-18T00:49:01.184593+00:00","updated_at":"2026-05-18T00:49:01.184593+00:00"}