{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UZTN6BEY25OCRIWSOZIEA33AWQ","short_pith_number":"pith:UZTN6BEY","schema_version":"1.0","canonical_sha256":"a666df0498d75c28a2d27650406f60b40617ce41f5d58cfcd0f652c27fed035a","source":{"kind":"arxiv","id":"2506.08810","version":3},"attestation_state":"computed","paper":{"title":"Infinite induced-saturated graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Carla Groenland, Marthe Bonamy, Natasha Morrison, Tom Johnston","submitted_at":"2025-06-10T14:00:59Z","abstract_excerpt":"A graph $G$ is $H$-induced-saturated if $G$ is $H$-free but deleting any edge or adding any edge creates an induced copy of $H$. There are non-trivial graphs $H$, such as $P_4$, for which no finite $H$-induced-saturated graph $G$ exists. We show that for every finite graph $H$ that is not a clique or an independent set, there always exists a countable $H$-induced-saturated graph. In fact, we show that a far stronger property can be achieved: there is a countably infinite $H$-free graph $G$ such that any graph $G'\\ne G$ obtained by making a locally finite set of changes to $G$ contains a copy o"},"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":"2506.08810","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T14:00:59Z","cross_cats_sorted":[],"title_canon_sha256":"62612d90e1848a00a9e5bc7aca9481cb1c7a8fea4df55cf3a648669bf326f77d","abstract_canon_sha256":"c2c2b9867696aa3abd989e3f82dc19a0f6c5b1a6deded065ea7f72a7927f57be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:47.006492Z","signature_b64":"kaoKcdVYAH9heobYLBIIPDed7inATqxjAPEn2cGkMcCOQLVj8qpYPjrz6LVC5aji9qMDsz/XjElNzrQkIPslAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a666df0498d75c28a2d27650406f60b40617ce41f5d58cfcd0f652c27fed035a","last_reissued_at":"2026-07-05T12:02:47.006017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:47.006017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite induced-saturated graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Carla Groenland, Marthe Bonamy, Natasha Morrison, Tom Johnston","submitted_at":"2025-06-10T14:00:59Z","abstract_excerpt":"A graph $G$ is $H$-induced-saturated if $G$ is $H$-free but deleting any edge or adding any edge creates an induced copy of $H$. There are non-trivial graphs $H$, such as $P_4$, for which no finite $H$-induced-saturated graph $G$ exists. We show that for every finite graph $H$ that is not a clique or an independent set, there always exists a countable $H$-induced-saturated graph. In fact, we show that a far stronger property can be achieved: there is a countably infinite $H$-free graph $G$ such that any graph $G'\\ne G$ obtained by making a locally finite set of changes to $G$ contains a copy o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08810","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.08810/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.08810","created_at":"2026-07-05T12:02:47.006080+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08810v3","created_at":"2026-07-05T12:02:47.006080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08810","created_at":"2026-07-05T12:02:47.006080+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZTN6BEY25OC","created_at":"2026-07-05T12:02:47.006080+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZTN6BEY25OCRIWS","created_at":"2026-07-05T12:02:47.006080+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZTN6BEY","created_at":"2026-07-05T12:02:47.006080+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/UZTN6BEY25OCRIWSOZIEA33AWQ","json":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ.json","graph_json":"https://pith.science/api/pith-number/UZTN6BEY25OCRIWSOZIEA33AWQ/graph.json","events_json":"https://pith.science/api/pith-number/UZTN6BEY25OCRIWSOZIEA33AWQ/events.json","paper":"https://pith.science/paper/UZTN6BEY"},"agent_actions":{"view_html":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ","download_json":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ.json","view_paper":"https://pith.science/paper/UZTN6BEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08810&json=true","fetch_graph":"https://pith.science/api/pith-number/UZTN6BEY25OCRIWSOZIEA33AWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UZTN6BEY25OCRIWSOZIEA33AWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ/action/storage_attestation","attest_author":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ/action/author_attestation","sign_citation":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ/action/citation_signature","submit_replication":"https://pith.science/pith/UZTN6BEY25OCRIWSOZIEA33AWQ/action/replication_record"}},"created_at":"2026-07-05T12:02:47.006080+00:00","updated_at":"2026-07-05T12:02:47.006080+00:00"}