{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:42PJNF3YYXGPBFBJUWJN7DNWKM","short_pith_number":"pith:42PJNF3Y","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"},"canonical_sha256":"e69e969778c5ccf09429a592df8db6530e43bdbb4482e486f9a1ea5677c5e45a","source":{"kind":"arxiv","id":"2606.24763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24763","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24763v1","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24763","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"42PJNF3YYXGP","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"pith_short_16","alias_value":"42PJNF3YYXGPBFBJ","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"pith_short_8","alias_value":"42PJNF3Y","created_at":"2026-06-24T01:15:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:42PJNF3YYXGPBFBJUWJN7DNWKM","target":"record","payload":{"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"},"canonical_sha256":"e69e969778c5ccf09429a592df8db6530e43bdbb4482e486f9a1ea5677c5e45a","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"},"source_kind":"arxiv","source_id":"2606.24763","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-06-24T01:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Exi/snGBT9/4LnFHg8H4Bgo7pPqst+Qj44PgteAxSF4tyvk6GA1JTDCCnM5kP1NgfBYtDStHJnThgppxXi0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:15:20.742969Z"},"content_sha256":"f28b48ffe8cbff80b1927c352b73e2c8be4f2f748c109782af1a56366c5e6100","schema_version":"1.0","event_id":"sha256:f28b48ffe8cbff80b1927c352b73e2c8be4f2f748c109782af1a56366c5e6100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:42PJNF3YYXGPBFBJUWJN7DNWKM","target":"graph","payload":{"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"},"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-06-24T01:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRJqdc7h6+xsmayNHyYx0soSM4dSpQsizcKAhO/JJ20iLh3g0uaIpAPuCihA/izeIuntCraG4J3X4BtwpQArDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:15:20.743494Z"},"content_sha256":"2596dbb3c23b8cd0149ca9059f11efbdc1e5090867f2cdab31d0fb2d3c57f059","schema_version":"1.0","event_id":"sha256:2596dbb3c23b8cd0149ca9059f11efbdc1e5090867f2cdab31d0fb2d3c57f059"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/bundle.json","state_url":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/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-08-08T16:15:20Z","links":{"resolver":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM","bundle":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/bundle.json","state":"https://pith.science/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42PJNF3YYXGPBFBJUWJN7DNWKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:42PJNF3YYXGPBFBJUWJN7DNWKM","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":"7a83f7b3b7905575b319034000facc6eccd96748c61a7097da6b1b1b736ac747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:20:18Z","title_canon_sha256":"37fb0b4a1bf531ab2249f5a54ac44a0ce851237694c65948e00bec52076b0a89"},"schema_version":"1.0","source":{"id":"2606.24763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24763","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24763v1","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24763","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"42PJNF3YYXGP","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"pith_short_16","alias_value":"42PJNF3YYXGPBFBJ","created_at":"2026-06-24T01:15:41Z"},{"alias_kind":"pith_short_8","alias_value":"42PJNF3Y","created_at":"2026-06-24T01:15:41Z"}],"graph_snapshots":[{"event_id":"sha256:2596dbb3c23b8cd0149ca9059f11efbdc1e5090867f2cdab31d0fb2d3c57f059","target":"graph","created_at":"2026-06-24T01:15:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24763/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Sahab Hajebi, Sepehr Hajebi, Sophie Spirkl, Xinyue Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:20:18Z","title":"Asymmetric induced saturation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24763","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:f28b48ffe8cbff80b1927c352b73e2c8be4f2f748c109782af1a56366c5e6100","target":"record","created_at":"2026-06-24T01:15:41Z","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":"7a83f7b3b7905575b319034000facc6eccd96748c61a7097da6b1b1b736ac747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:20:18Z","title_canon_sha256":"37fb0b4a1bf531ab2249f5a54ac44a0ce851237694c65948e00bec52076b0a89"},"schema_version":"1.0","source":{"id":"2606.24763","kind":"arxiv","version":1}},"canonical_sha256":"e69e969778c5ccf09429a592df8db6530e43bdbb4482e486f9a1ea5677c5e45a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e69e969778c5ccf09429a592df8db6530e43bdbb4482e486f9a1ea5677c5e45a","first_computed_at":"2026-06-24T01:15:41.572399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:41.572399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gKxNbYqp8hVkzWvQP429ANy+j7mULvstyKc/r/OfIzJ6cfvZMaZ/gxEmb/HNmAkTREB33d1g+Mfpd7cN21uyDg==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:41.572815Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f28b48ffe8cbff80b1927c352b73e2c8be4f2f748c109782af1a56366c5e6100","sha256:2596dbb3c23b8cd0149ca9059f11efbdc1e5090867f2cdab31d0fb2d3c57f059"],"state_sha256":"9355a8d41f0d70ba3aab15fe16a7949cf6866ac54d82308bee0446902be22c1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6uSb4g0j7SiZbDcbN89rPX/aI4/DgPkow6SYF6I1ZudFL34mhbH0uZiH2TKfs+HB5uhY3ZdZtw39hLVdOPaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:15:20.747734Z","bundle_sha256":"6e1ce6c4e7674faf98a645bb6ac082ddb2ef0bd35568f4daed9e2ac5123dbddf"}}