{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7AF4GEL26TQ5HR2SGGUYUBWWOM","short_pith_number":"pith:7AF4GEL2","schema_version":"1.0","canonical_sha256":"f80bc3117af4e1d3c75231a98a06d67337a4f62ee1cd549a50ab88acb112c292","source":{"kind":"arxiv","id":"1909.02718","version":2},"attestation_state":"computed","paper":{"title":"Stable structure on safe set problems in vertex-weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Shinya Fujita, Tadashi Sakuma","submitted_at":"2019-09-06T05:29:36Z","abstract_excerpt":"Let $G$ be a graph, and let $w$ be a positive real-valued weight function on $V(G)$. For every subset $S$ of $V(G)$, let $w(S)=\\sum_{v \\in S} w(v).$ A non-empty subset $S \\subset V(G)$ is a weighted safe set of $(G,w)$ if, for every component $C$ of the subgraph induced by $S$ and every component $D$ of $G-S$, we have $w(C) \\geq w(D)$ whenever there is an edge between $C$ and $D$. If the subgraph of $G$ induced by a weighted safe set $S$ is connected, then the set $S$ is called a connected weighted safe set of $(G,w)$. The weighted safe number $\\mathrm{s}(G,w)$ and connected weighted safe numb"},"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":"1909.02718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-06T05:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"e45a4e902b3cd8651434a8eca27d18f0ea23a567c3f66d25b8e9ddb90b60b115","abstract_canon_sha256":"e78fb601435bd95fd32970d6befc58bdabc33326db93165c4b1ecb35117e40f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:03.658670Z","signature_b64":"oVqvwknWSSutNjhRefim92g7XpRnRo+9clzcnfeNlltMqY1SZ9D0YAt3u96bsAIG1rLzJyZwbBZse5zQfwl0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f80bc3117af4e1d3c75231a98a06d67337a4f62ee1cd549a50ab88acb112c292","last_reissued_at":"2026-07-05T00:43:03.658155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:03.658155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable structure on safe set problems in vertex-weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Shinya Fujita, Tadashi Sakuma","submitted_at":"2019-09-06T05:29:36Z","abstract_excerpt":"Let $G$ be a graph, and let $w$ be a positive real-valued weight function on $V(G)$. For every subset $S$ of $V(G)$, let $w(S)=\\sum_{v \\in S} w(v).$ A non-empty subset $S \\subset V(G)$ is a weighted safe set of $(G,w)$ if, for every component $C$ of the subgraph induced by $S$ and every component $D$ of $G-S$, we have $w(C) \\geq w(D)$ whenever there is an edge between $C$ and $D$. If the subgraph of $G$ induced by a weighted safe set $S$ is connected, then the set $S$ is called a connected weighted safe set of $(G,w)$. The weighted safe number $\\mathrm{s}(G,w)$ and connected weighted safe numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02718","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.02718/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":"1909.02718","created_at":"2026-07-05T00:43:03.658215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.02718v2","created_at":"2026-07-05T00:43:03.658215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02718","created_at":"2026-07-05T00:43:03.658215+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AF4GEL26TQ5","created_at":"2026-07-05T00:43:03.658215+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AF4GEL26TQ5HR2S","created_at":"2026-07-05T00:43:03.658215+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AF4GEL2","created_at":"2026-07-05T00:43:03.658215+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/7AF4GEL26TQ5HR2SGGUYUBWWOM","json":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM.json","graph_json":"https://pith.science/api/pith-number/7AF4GEL26TQ5HR2SGGUYUBWWOM/graph.json","events_json":"https://pith.science/api/pith-number/7AF4GEL26TQ5HR2SGGUYUBWWOM/events.json","paper":"https://pith.science/paper/7AF4GEL2"},"agent_actions":{"view_html":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM","download_json":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM.json","view_paper":"https://pith.science/paper/7AF4GEL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.02718&json=true","fetch_graph":"https://pith.science/api/pith-number/7AF4GEL26TQ5HR2SGGUYUBWWOM/graph.json","fetch_events":"https://pith.science/api/pith-number/7AF4GEL26TQ5HR2SGGUYUBWWOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM/action/storage_attestation","attest_author":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM/action/author_attestation","sign_citation":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM/action/citation_signature","submit_replication":"https://pith.science/pith/7AF4GEL26TQ5HR2SGGUYUBWWOM/action/replication_record"}},"created_at":"2026-07-05T00:43:03.658215+00:00","updated_at":"2026-07-05T00:43:03.658215+00:00"}