{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:42PJNF3YYXGPBFBJUWJN7DNWKM","short_pith_number":"pith:42PJNF3Y","schema_version":"1.0","canonical_sha256":"e69e969778c5ccf09429a592df8db6530e43bdbb4482e486f9a1ea5677c5e45a","source":{"kind":"arxiv","id":"2606.24763","version":1},"attestation_state":"computed","paper":{"title":"Asymmetric induced saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sahab Hajebi, Sepehr Hajebi, Sophie Spirkl, Xinyue Fan","submitted_at":"2026-06-23T16:20:18Z","abstract_excerpt":"For which graphs $H$ does there exist a graph $G$ with at least one edge and no induced subgraph isomorphic to $H$, such that deleting any edge of $G$ creates an induced copy of $H$? We call such a graph \"$H$-deletion-saturated\". This version of the well-studied notion of \"$H$-induced-saturated\" graphs -- where both adding and deleting any edge creates an induced copy of $H$ -- appears more tractable. For example, while it remains wide open whether $H$-induced-saturated graphs exist for every even cycle $H$, we proved recently that deletion-saturated graphs exist for all even cycles. In fact, "},"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":"2606.24763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"37fb0b4a1bf531ab2249f5a54ac44a0ce851237694c65948e00bec52076b0a89","abstract_canon_sha256":"7a83f7b3b7905575b319034000facc6eccd96748c61a7097da6b1b1b736ac747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:41.572815Z","signature_b64":"gKxNbYqp8hVkzWvQP429ANy+j7mULvstyKc/r/OfIzJ6cfvZMaZ/gxEmb/HNmAkTREB33d1g+Mfpd7cN21uyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e69e969778c5ccf09429a592df8db6530e43bdbb4482e486f9a1ea5677c5e45a","last_reissued_at":"2026-06-24T01:15:41.572399Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:41.572399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetric induced saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sahab Hajebi, Sepehr Hajebi, Sophie Spirkl, Xinyue Fan","submitted_at":"2026-06-23T16:20:18Z","abstract_excerpt":"For which graphs $H$ does there exist a graph $G$ with at least one edge and no induced subgraph isomorphic to $H$, such that deleting any edge of $G$ creates an induced copy of $H$? We call such a graph \"$H$-deletion-saturated\". This version of the well-studied notion of \"$H$-induced-saturated\" graphs -- where both adding and deleting any edge creates an induced copy of $H$ -- appears more tractable. For example, while it remains wide open whether $H$-induced-saturated graphs exist for every even cycle $H$, we proved recently that deletion-saturated graphs exist for all even cycles. In fact, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24763","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.24763/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":"2606.24763","created_at":"2026-06-24T01:15:41.572465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24763v1","created_at":"2026-06-24T01:15:41.572465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24763","created_at":"2026-06-24T01:15:41.572465+00:00"},{"alias_kind":"pith_short_12","alias_value":"42PJNF3YYXGP","created_at":"2026-06-24T01:15:41.572465+00:00"},{"alias_kind":"pith_short_16","alias_value":"42PJNF3YYXGPBFBJ","created_at":"2026-06-24T01:15:41.572465+00:00"},{"alias_kind":"pith_short_8","alias_value":"42PJNF3Y","created_at":"2026-06-24T01:15:41.572465+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/42PJNF3YYXGPBFBJUWJN7DNWKM","json":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM.json","graph_json":"https://pith.science/api/pith-number/42PJNF3YYXGPBFBJUWJN7DNWKM/graph.json","events_json":"https://pith.science/api/pith-number/42PJNF3YYXGPBFBJUWJN7DNWKM/events.json","paper":"https://pith.science/paper/42PJNF3Y"},"agent_actions":{"view_html":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM","download_json":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM.json","view_paper":"https://pith.science/paper/42PJNF3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24763&json=true","fetch_graph":"https://pith.science/api/pith-number/42PJNF3YYXGPBFBJUWJN7DNWKM/graph.json","fetch_events":"https://pith.science/api/pith-number/42PJNF3YYXGPBFBJUWJN7DNWKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/action/storage_attestation","attest_author":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/action/author_attestation","sign_citation":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/action/citation_signature","submit_replication":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/action/replication_record"}},"created_at":"2026-06-24T01:15:41.572465+00:00","updated_at":"2026-06-24T01:15:41.572465+00:00"}