{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JNTZXHWK3YAP2UPFG3Y5FEKNBK","short_pith_number":"pith:JNTZXHWK","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"},"canonical_sha256":"4b679b9ecade00fd51e536f1d2914d0ab5079d8f50b446492b6abff63775b9ec","source":{"kind":"arxiv","id":"2606.21190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21190","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21190v1","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21190","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"JNTZXHWK3YAP","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"pith_short_16","alias_value":"JNTZXHWK3YAP2UPF","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"pith_short_8","alias_value":"JNTZXHWK","created_at":"2026-06-23T01:12:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JNTZXHWK3YAP2UPFG3Y5FEKNBK","target":"record","payload":{"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"},"canonical_sha256":"4b679b9ecade00fd51e536f1d2914d0ab5079d8f50b446492b6abff63775b9ec","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"},"source_kind":"arxiv","source_id":"2606.21190","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-23T01:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXAQKFnQhB+Jg53rN8bwpKegK2HrAOWs9Pa6S4Z1WaMKcw7aV4hNsR3tL1RblopuPGTxMJuE/bbSU57hH97DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:33:14.036991Z"},"content_sha256":"e817e9fb24781ad8942ae2f5ca8dae87444ab3df90881417b0ff66980947f7c7","schema_version":"1.0","event_id":"sha256:e817e9fb24781ad8942ae2f5ca8dae87444ab3df90881417b0ff66980947f7c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JNTZXHWK3YAP2UPFG3Y5FEKNBK","target":"graph","payload":{"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"},"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-23T01:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLYAHtun1tgrtIqjE9cAlg8x0MMx2yh5GpiSuwehdd3SzWDXZxajLcTz66DVQ4PzJOhBH+QMdWaoF1oLnIiEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:33:14.037403Z"},"content_sha256":"5edabbe88a21a9fd979ecfa01aaae4eae289e074ff397ffb66a3bf296eeecb9e","schema_version":"1.0","event_id":"sha256:5edabbe88a21a9fd979ecfa01aaae4eae289e074ff397ffb66a3bf296eeecb9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/bundle.json","state_url":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/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-06-23T10:33:14Z","links":{"resolver":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK","bundle":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/bundle.json","state":"https://pith.science/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNTZXHWK3YAP2UPFG3Y5FEKNBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JNTZXHWK3YAP2UPFG3Y5FEKNBK","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":"aa64e30706fff89620fbf20643ab30a489a9700253e5431f7747a521c3eeea3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T07:59:58Z","title_canon_sha256":"050af4076fd7b8417713115231a48df3c02d8e081a6746757d8852b4de5a5b28"},"schema_version":"1.0","source":{"id":"2606.21190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21190","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21190v1","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21190","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"JNTZXHWK3YAP","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"pith_short_16","alias_value":"JNTZXHWK3YAP2UPF","created_at":"2026-06-23T01:12:32Z"},{"alias_kind":"pith_short_8","alias_value":"JNTZXHWK","created_at":"2026-06-23T01:12:32Z"}],"graph_snapshots":[{"event_id":"sha256:5edabbe88a21a9fd979ecfa01aaae4eae289e074ff397ffb66a3bf296eeecb9e","target":"graph","created_at":"2026-06-23T01:12:32Z","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.21190/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Magda Dettlaff, Magdalena Lema\\'nska, Merce Mora, Pawe{\\l} \\.Zyli\\'nski, Rados{\\l}aw Ziemann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T07:59:58Z","title":"Isolation subdivision number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21190","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:e817e9fb24781ad8942ae2f5ca8dae87444ab3df90881417b0ff66980947f7c7","target":"record","created_at":"2026-06-23T01:12:32Z","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":"aa64e30706fff89620fbf20643ab30a489a9700253e5431f7747a521c3eeea3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T07:59:58Z","title_canon_sha256":"050af4076fd7b8417713115231a48df3c02d8e081a6746757d8852b4de5a5b28"},"schema_version":"1.0","source":{"id":"2606.21190","kind":"arxiv","version":1}},"canonical_sha256":"4b679b9ecade00fd51e536f1d2914d0ab5079d8f50b446492b6abff63775b9ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b679b9ecade00fd51e536f1d2914d0ab5079d8f50b446492b6abff63775b9ec","first_computed_at":"2026-06-23T01:12:32.914982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:12:32.914982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pI8bGyhESejTJar/HWXUoLLCd3gMTnu7Q9xL/PV1r7tXoXAj2CfHTOwRVEXPhp38yHmedcyhUTG0GkDtesJPCg==","signature_status":"signed_v1","signed_at":"2026-06-23T01:12:32.915465Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e817e9fb24781ad8942ae2f5ca8dae87444ab3df90881417b0ff66980947f7c7","sha256:5edabbe88a21a9fd979ecfa01aaae4eae289e074ff397ffb66a3bf296eeecb9e"],"state_sha256":"1dcf17cc595615bc3be77df371205c9aa4f896cdb2014000a5c6d4f249713985"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBZdrnCL+2z4qP982TPlcTyqg++4/XgCp5an1U2Pn/o9FrLPOa+HkREu2v+SUm0QkY4hVAC2DURjUJRq4vuDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T10:33:14.039454Z","bundle_sha256":"ab5898358138613c2e6e97494c2861c80b59307ecf61ba456edc5b932317bdf6"}}