{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:63AMNNKP4M765MA6NTUY5K7CDP","short_pith_number":"pith:63AMNNKP","schema_version":"1.0","canonical_sha256":"f6c0c6b54fe33feeb01e6ce98eabe21be0abdb56d12a76409c7e377eff14efe8","source":{"kind":"arxiv","id":"1610.00117","version":2},"attestation_state":"computed","paper":{"title":"Robustness of graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov","submitted_at":"2016-10-01T10:51:09Z","abstract_excerpt":"A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\\cal P$. Can one strengthen the result by showing that $G$ possesses $\\cal P$ in a robust way? What measures of robustness can one utilize? In this survey, we discuss various measures that can be used to study robustness of graph properties, illustrating them with examples."},"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":"1610.00117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-01T10:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"58d7c463e128ef332534e7b3fd6abb92ac533ea1de8c76c5805e2017a145d43f","abstract_canon_sha256":"14488234e1b23a9a558d7560748d64d7e4e26ce4fa0cc943ee65d1a46c0818b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.230659Z","signature_b64":"icwRp00e+kWxhRb1XN+yzFCFVC1MAsBQ30w62S/rtnMhHGg8SZ2kfqeXg3+jTsfXfRpupeg4KSDzLZZrI9mNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c0c6b54fe33feeb01e6ce98eabe21be0abdb56d12a76409c7e377eff14efe8","last_reissued_at":"2026-05-18T00:59:34.230012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.230012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov","submitted_at":"2016-10-01T10:51:09Z","abstract_excerpt":"A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\\cal P$. Can one strengthen the result by showing that $G$ possesses $\\cal P$ in a robust way? What measures of robustness can one utilize? In this survey, we discuss various measures that can be used to study robustness of graph properties, illustrating them with examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00117","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":"1610.00117","created_at":"2026-05-18T00:59:34.230134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00117v2","created_at":"2026-05-18T00:59:34.230134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00117","created_at":"2026-05-18T00:59:34.230134+00:00"},{"alias_kind":"pith_short_12","alias_value":"63AMNNKP4M76","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"63AMNNKP4M765MA6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"63AMNNKP","created_at":"2026-05-18T12:30:01.593930+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/63AMNNKP4M765MA6NTUY5K7CDP","json":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP.json","graph_json":"https://pith.science/api/pith-number/63AMNNKP4M765MA6NTUY5K7CDP/graph.json","events_json":"https://pith.science/api/pith-number/63AMNNKP4M765MA6NTUY5K7CDP/events.json","paper":"https://pith.science/paper/63AMNNKP"},"agent_actions":{"view_html":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP","download_json":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP.json","view_paper":"https://pith.science/paper/63AMNNKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00117&json=true","fetch_graph":"https://pith.science/api/pith-number/63AMNNKP4M765MA6NTUY5K7CDP/graph.json","fetch_events":"https://pith.science/api/pith-number/63AMNNKP4M765MA6NTUY5K7CDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP/action/storage_attestation","attest_author":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP/action/author_attestation","sign_citation":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP/action/citation_signature","submit_replication":"https://pith.science/pith/63AMNNKP4M765MA6NTUY5K7CDP/action/replication_record"}},"created_at":"2026-05-18T00:59:34.230134+00:00","updated_at":"2026-05-18T00:59:34.230134+00:00"}