{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HRRS3HZUKIX7SZBDTM75ATKJKO","short_pith_number":"pith:HRRS3HZU","schema_version":"1.0","canonical_sha256":"3c632d9f34522ff964239b3fd04d49538b8dc046837311244d0cae484eab8b9f","source":{"kind":"arxiv","id":"1711.11412","version":2},"attestation_state":"computed","paper":{"title":"Approximating Connected Safe Sets in Weighted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Stefan Ehard","submitted_at":"2017-11-30T14:18:55Z","abstract_excerpt":"For a graph $G$ and a non-negative integral weight function $w$ on the vertex set of $G$, a set $S$ of vertices of $G$ is $w$-safe if $w(C)\\geq w(D)$ for every component $C$ of the subgraph of $G$ induced by $S$ and every component $D$ of the subgraph of $G$ induced by the complement of $S$ such that some vertex in $C$ is adjacent to some vertex of $D$. The minimum weight $w(S)$ of a $w$-safe set $S$ is the safe number $s(G,w)$ of the weighted graph $(G,w)$, and the minimum weight of a $w$-safe set that induces a connected subgraph of $G$ is its connected safe number $cs(G,w)$. Bapat et al. sh"},"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":"1711.11412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-30T14:18:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"05b183956809de6c90dd40c550df7d7b8c950b37a409754606cbb0ff37367666","abstract_canon_sha256":"e1398dbf72b0c5883e92995192c298434783c0563635334011dd4f5b0a031b72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:05.262988Z","signature_b64":"bKTeonjqixjC0PnwrBOErkGRG1VbncDy9R7CNottKWyD4sGah1hXXGww6KCl82ElEqwFE3ElxUcp6xGvtog1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c632d9f34522ff964239b3fd04d49538b8dc046837311244d0cae484eab8b9f","last_reissued_at":"2026-05-18T00:29:05.262506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:05.262506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Connected Safe Sets in Weighted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Stefan Ehard","submitted_at":"2017-11-30T14:18:55Z","abstract_excerpt":"For a graph $G$ and a non-negative integral weight function $w$ on the vertex set of $G$, a set $S$ of vertices of $G$ is $w$-safe if $w(C)\\geq w(D)$ for every component $C$ of the subgraph of $G$ induced by $S$ and every component $D$ of the subgraph of $G$ induced by the complement of $S$ such that some vertex in $C$ is adjacent to some vertex of $D$. The minimum weight $w(S)$ of a $w$-safe set $S$ is the safe number $s(G,w)$ of the weighted graph $(G,w)$, and the minimum weight of a $w$-safe set that induces a connected subgraph of $G$ is its connected safe number $cs(G,w)$. Bapat et al. sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11412","kind":"arxiv","version":2},"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":"1711.11412","created_at":"2026-05-18T00:29:05.262579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11412v2","created_at":"2026-05-18T00:29:05.262579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11412","created_at":"2026-05-18T00:29:05.262579+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRRS3HZUKIX7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRRS3HZUKIX7SZBD","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRRS3HZU","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02718","citing_title":"Stable structure on safe set problems in vertex-weighted graphs","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO","json":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO.json","graph_json":"https://pith.science/api/pith-number/HRRS3HZUKIX7SZBDTM75ATKJKO/graph.json","events_json":"https://pith.science/api/pith-number/HRRS3HZUKIX7SZBDTM75ATKJKO/events.json","paper":"https://pith.science/paper/HRRS3HZU"},"agent_actions":{"view_html":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO","download_json":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO.json","view_paper":"https://pith.science/paper/HRRS3HZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11412&json=true","fetch_graph":"https://pith.science/api/pith-number/HRRS3HZUKIX7SZBDTM75ATKJKO/graph.json","fetch_events":"https://pith.science/api/pith-number/HRRS3HZUKIX7SZBDTM75ATKJKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/action/storage_attestation","attest_author":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/action/author_attestation","sign_citation":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/action/citation_signature","submit_replication":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/action/replication_record"}},"created_at":"2026-05-18T00:29:05.262579+00:00","updated_at":"2026-05-18T00:29:05.262579+00:00"}