{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HRRS3HZUKIX7SZBDTM75ATKJKO","short_pith_number":"pith:HRRS3HZU","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"},"canonical_sha256":"3c632d9f34522ff964239b3fd04d49538b8dc046837311244d0cae484eab8b9f","source":{"kind":"arxiv","id":"1711.11412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11412","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11412v2","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11412","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"HRRS3HZUKIX7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRRS3HZUKIX7SZBD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRRS3HZU","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HRRS3HZUKIX7SZBDTM75ATKJKO","target":"record","payload":{"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"},"canonical_sha256":"3c632d9f34522ff964239b3fd04d49538b8dc046837311244d0cae484eab8b9f","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"},"source_kind":"arxiv","source_id":"1711.11412","source_version":2,"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-05-18T00:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNDhVd2g+AJ265kdGsqNuRq7O+3SzxVuM0CZ4Bw+FVXNPMK0WhsuW9rH1iCtCKtx9iniLxuTTbWUFN6ozH4hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:41:33.939999Z"},"content_sha256":"8dec0defbb8b05694fd30e0af924dbb2da6d05afe9c7005e2260eee31cb433b0","schema_version":"1.0","event_id":"sha256:8dec0defbb8b05694fd30e0af924dbb2da6d05afe9c7005e2260eee31cb433b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HRRS3HZUKIX7SZBDTM75ATKJKO","target":"graph","payload":{"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"},"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-05-18T00:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sn1dQnoTFHM+4TIB2HfvpiB4bNGOZdwJJRqyxEfPLPstxAMBxNLjkhHNrYeEQJSLqXIwbcUPWEI2amJ4QdWjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:41:33.940837Z"},"content_sha256":"fc32b92d822cb33d342e04b3bb0d35c7236bc853e1c9226d637a1e457a9e10f5","schema_version":"1.0","event_id":"sha256:fc32b92d822cb33d342e04b3bb0d35c7236bc853e1c9226d637a1e457a9e10f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/bundle.json","state_url":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/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-16T12:41:33Z","links":{"resolver":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO","bundle":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/bundle.json","state":"https://pith.science/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRRS3HZUKIX7SZBDTM75ATKJKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HRRS3HZUKIX7SZBDTM75ATKJKO","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":"e1398dbf72b0c5883e92995192c298434783c0563635334011dd4f5b0a031b72","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-30T14:18:55Z","title_canon_sha256":"05b183956809de6c90dd40c550df7d7b8c950b37a409754606cbb0ff37367666"},"schema_version":"1.0","source":{"id":"1711.11412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11412","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11412v2","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11412","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"HRRS3HZUKIX7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRRS3HZUKIX7SZBD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRRS3HZU","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:fc32b92d822cb33d342e04b3bb0d35c7236bc853e1c9226d637a1e457a9e10f5","target":"graph","created_at":"2026-05-18T00:29:05Z","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"},"paper":{"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","authors_text":"Dieter Rautenbach, Stefan Ehard","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-30T14:18:55Z","title":"Approximating Connected Safe Sets in Weighted Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11412","kind":"arxiv","version":2},"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:8dec0defbb8b05694fd30e0af924dbb2da6d05afe9c7005e2260eee31cb433b0","target":"record","created_at":"2026-05-18T00:29:05Z","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":"e1398dbf72b0c5883e92995192c298434783c0563635334011dd4f5b0a031b72","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-30T14:18:55Z","title_canon_sha256":"05b183956809de6c90dd40c550df7d7b8c950b37a409754606cbb0ff37367666"},"schema_version":"1.0","source":{"id":"1711.11412","kind":"arxiv","version":2}},"canonical_sha256":"3c632d9f34522ff964239b3fd04d49538b8dc046837311244d0cae484eab8b9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c632d9f34522ff964239b3fd04d49538b8dc046837311244d0cae484eab8b9f","first_computed_at":"2026-05-18T00:29:05.262506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:05.262506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bKTeonjqixjC0PnwrBOErkGRG1VbncDy9R7CNottKWyD4sGah1hXXGww6KCl82ElEqwFE3ElxUcp6xGvtog1BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:05.262988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dec0defbb8b05694fd30e0af924dbb2da6d05afe9c7005e2260eee31cb433b0","sha256:fc32b92d822cb33d342e04b3bb0d35c7236bc853e1c9226d637a1e457a9e10f5"],"state_sha256":"fa64f77771c09c566c8f346d4e189f7a74c80a9ea22a12eec8f979b92d154138"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYgKGmraktbw8QNWnTwWM584h9L/bn9wE4PoYRl0bTfbT7z+upFd6u2oNvgz5dxh/y5gxjrnhiRo4ll1voYFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:41:33.947455Z","bundle_sha256":"6fcbab73f6dabeaacf3afa0990ba64598d8ed4599a004defdcd8936a5d092a50"}}