{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M3PJCRFIUAAEPHTZMS2NEGPWOM","short_pith_number":"pith:M3PJCRFI","schema_version":"1.0","canonical_sha256":"66de9144a8a000479e7964b4d219f67338fd12c315cc771e630c606563cc3e51","source":{"kind":"arxiv","id":"1907.05546","version":1},"attestation_state":"computed","paper":{"title":"On induced saturation for paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Eun-Kyung Cho, Ilkyoo Choi","submitted_at":"2019-07-12T02:04:31Z","abstract_excerpt":"For a graph $H$, a graph $G$ is $H$-induced-saturated if $G$ does not contain an induced copy of $H$, but either removing an edge from $G$ or adding a non-edge to $G$ creates an induced copy of $H$. Depending on the graph $H$, an $H$-induced-saturated graph does not necessarily exist. In fact, Martin and Smith (2012) showed that $P_4$-induced-saturated graphs do not exist, where $P_k$ denotes a path on $k$ vertices. Axenovich and Csik\\'{o}s (2019) asked the existence of $P_k$-induced-saturated graphs for $k \\ge 5$; it is easy to construct such graphs when $k\\in\\{2, 3\\}$. Recently, R\\\"{a}ty con"},"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":"1907.05546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-12T02:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"969027db7aae897e39c945bb644e4dad751cf88feb2c59396ff49c34a110a6f1","abstract_canon_sha256":"d1da37e933e88646fe342b8e0a3c4c2eff1f1dfcf713fcd98dc9febee61b0abd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:47.991145Z","signature_b64":"+IjDGKCuYPWSKv8niV0EH97nWoP6v11iKU/csjtT6PizJPNt+dKIHHuNnQH96avdZJL6zrxGKXdAbS9Ffiu4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66de9144a8a000479e7964b4d219f67338fd12c315cc771e630c606563cc3e51","last_reissued_at":"2026-05-17T23:40:47.990579Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:47.990579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On induced saturation for paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Eun-Kyung Cho, Ilkyoo Choi","submitted_at":"2019-07-12T02:04:31Z","abstract_excerpt":"For a graph $H$, a graph $G$ is $H$-induced-saturated if $G$ does not contain an induced copy of $H$, but either removing an edge from $G$ or adding a non-edge to $G$ creates an induced copy of $H$. Depending on the graph $H$, an $H$-induced-saturated graph does not necessarily exist. In fact, Martin and Smith (2012) showed that $P_4$-induced-saturated graphs do not exist, where $P_k$ denotes a path on $k$ vertices. Axenovich and Csik\\'{o}s (2019) asked the existence of $P_k$-induced-saturated graphs for $k \\ge 5$; it is easy to construct such graphs when $k\\in\\{2, 3\\}$. Recently, R\\\"{a}ty con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05546","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":"1907.05546","created_at":"2026-05-17T23:40:47.990669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05546v1","created_at":"2026-05-17T23:40:47.990669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05546","created_at":"2026-05-17T23:40:47.990669+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3PJCRFIUAAE","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3PJCRFIUAAEPHTZ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3PJCRFI","created_at":"2026-05-18T12:33:21.387695+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/M3PJCRFIUAAEPHTZMS2NEGPWOM","json":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM.json","graph_json":"https://pith.science/api/pith-number/M3PJCRFIUAAEPHTZMS2NEGPWOM/graph.json","events_json":"https://pith.science/api/pith-number/M3PJCRFIUAAEPHTZMS2NEGPWOM/events.json","paper":"https://pith.science/paper/M3PJCRFI"},"agent_actions":{"view_html":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM","download_json":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM.json","view_paper":"https://pith.science/paper/M3PJCRFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05546&json=true","fetch_graph":"https://pith.science/api/pith-number/M3PJCRFIUAAEPHTZMS2NEGPWOM/graph.json","fetch_events":"https://pith.science/api/pith-number/M3PJCRFIUAAEPHTZMS2NEGPWOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM/action/storage_attestation","attest_author":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM/action/author_attestation","sign_citation":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM/action/citation_signature","submit_replication":"https://pith.science/pith/M3PJCRFIUAAEPHTZMS2NEGPWOM/action/replication_record"}},"created_at":"2026-05-17T23:40:47.990669+00:00","updated_at":"2026-05-17T23:40:47.990669+00:00"}