{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JNTZXHWK3YAP2UPFG3Y5FEKNBK","short_pith_number":"pith:JNTZXHWK","schema_version":"1.0","canonical_sha256":"4b679b9ecade00fd51e536f1d2914d0ab5079d8f50b446492b6abff63775b9ec","source":{"kind":"arxiv","id":"2606.21190","version":1},"attestation_state":"computed","paper":{"title":"Isolation subdivision number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Magda Dettlaff, Magdalena Lema\\'nska, Merce Mora, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","submitted_at":"2026-06-19T07:59:58Z","abstract_excerpt":"For a graph $G=(V,E),$ a set $S \\subseteq V$ is called an isolating set of $G$ if the set $V-N[S]$ is independent. The minimum cardinality of an isolating set in $G$ is the isolation number of $G$, denoted by $\\iota(G).$ Here we introduce the isolation subdivision number of a graph $G$, denoted by ${\\rm sd}_\\iota(G)$, as the minimum number of edges of $G$ that must be subdivided, where each edge can be subdivided at most once, in order to obtain a graph with isolation number greater than $\\iota(G).$ We show that the new parameter is well defined for any non-trivial graph different from a star "},"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.21190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T07:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"050af4076fd7b8417713115231a48df3c02d8e081a6746757d8852b4de5a5b28","abstract_canon_sha256":"aa64e30706fff89620fbf20643ab30a489a9700253e5431f7747a521c3eeea3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:32.915465Z","signature_b64":"pI8bGyhESejTJar/HWXUoLLCd3gMTnu7Q9xL/PV1r7tXoXAj2CfHTOwRVEXPhp38yHmedcyhUTG0GkDtesJPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b679b9ecade00fd51e536f1d2914d0ab5079d8f50b446492b6abff63775b9ec","last_reissued_at":"2026-06-23T01:12:32.914982Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:32.914982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isolation subdivision number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Magda Dettlaff, Magdalena Lema\\'nska, Merce Mora, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","submitted_at":"2026-06-19T07:59:58Z","abstract_excerpt":"For a graph $G=(V,E),$ a set $S \\subseteq V$ is called an isolating set of $G$ if the set $V-N[S]$ is independent. The minimum cardinality of an isolating set in $G$ is the isolation number of $G$, denoted by $\\iota(G).$ Here we introduce the isolation subdivision number of a graph $G$, denoted by ${\\rm sd}_\\iota(G)$, as the minimum number of edges of $G$ that must be subdivided, where each edge can be subdivided at most once, in order to obtain a graph with isolation number greater than $\\iota(G).$ We show that the new parameter is well defined for any non-trivial graph different from a star "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21190","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.21190/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.21190","created_at":"2026-06-23T01:12:32.915059+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21190v1","created_at":"2026-06-23T01:12:32.915059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21190","created_at":"2026-06-23T01:12:32.915059+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNTZXHWK3YAP","created_at":"2026-06-23T01:12:32.915059+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNTZXHWK3YAP2UPF","created_at":"2026-06-23T01:12:32.915059+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNTZXHWK","created_at":"2026-06-23T01:12:32.915059+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/JNTZXHWK3YAP2UPFG3Y5FEKNBK","json":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK.json","graph_json":"https://pith.science/api/pith-number/JNTZXHWK3YAP2UPFG3Y5FEKNBK/graph.json","events_json":"https://pith.science/api/pith-number/JNTZXHWK3YAP2UPFG3Y5FEKNBK/events.json","paper":"https://pith.science/paper/JNTZXHWK"},"agent_actions":{"view_html":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK","download_json":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK.json","view_paper":"https://pith.science/paper/JNTZXHWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21190&json=true","fetch_graph":"https://pith.science/api/pith-number/JNTZXHWK3YAP2UPFG3Y5FEKNBK/graph.json","fetch_events":"https://pith.science/api/pith-number/JNTZXHWK3YAP2UPFG3Y5FEKNBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/action/storage_attestation","attest_author":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/action/author_attestation","sign_citation":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/action/citation_signature","submit_replication":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/action/replication_record"}},"created_at":"2026-06-23T01:12:32.915059+00:00","updated_at":"2026-06-23T01:12:32.915059+00:00"}