{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BDHTR7MGPDGYRH5RNTM4U2VJ3R","short_pith_number":"pith:BDHTR7MG","schema_version":"1.0","canonical_sha256":"08cf38fd8678cd889fb16cd9ca6aa9dc4e759b9fc2cc16b5c1e9e6bce1a9405f","source":{"kind":"arxiv","id":"1802.03579","version":2},"attestation_state":"computed","paper":{"title":"On the weighted safe set problem on paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Shinya Fujita, Tadashi Sakuma, Tommy Jensen","submitted_at":"2018-02-10T12:48:48Z","abstract_excerpt":"Let $G$ be a graph, and let $w: V(G) \\to \\mathbb{R}$ be a weight function on the vertices of $G$. For every subset $X$ of $V(G)$, let $w(X)=\\sum_{v \\in X} 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 $s(G,w)$ and connected weighted safe "},"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":"1802.03579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T12:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"caa2f4fe6fba027d5a9020ae7a4652008678a6252c4c0ea56ae0e95d043163a2","abstract_canon_sha256":"2fd848dcc28579feed225d9aca89777f5baf37c1e790b5a6a0c5034ebee5bae4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:40.361186Z","signature_b64":"KzR5cmsagWvFj68SNnP/7USOuI0LEq7VmDvp5YKRAFfraCviyCNOb+E/e2TX8KLD85L6odzJq//HGFaXGjOdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08cf38fd8678cd889fb16cd9ca6aa9dc4e759b9fc2cc16b5c1e9e6bce1a9405f","last_reissued_at":"2026-05-18T00:14:40.360552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:40.360552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the weighted safe set problem on paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Shinya Fujita, Tadashi Sakuma, Tommy Jensen","submitted_at":"2018-02-10T12:48:48Z","abstract_excerpt":"Let $G$ be a graph, and let $w: V(G) \\to \\mathbb{R}$ be a weight function on the vertices of $G$. For every subset $X$ of $V(G)$, let $w(X)=\\sum_{v \\in X} 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 $s(G,w)$ and connected weighted safe "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03579","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":"1802.03579","created_at":"2026-05-18T00:14:40.360645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03579v2","created_at":"2026-05-18T00:14:40.360645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03579","created_at":"2026-05-18T00:14:40.360645+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDHTR7MGPDGY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDHTR7MGPDGYRH5R","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDHTR7MG","created_at":"2026-05-18T12:32:13.499390+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/BDHTR7MGPDGYRH5RNTM4U2VJ3R","json":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R.json","graph_json":"https://pith.science/api/pith-number/BDHTR7MGPDGYRH5RNTM4U2VJ3R/graph.json","events_json":"https://pith.science/api/pith-number/BDHTR7MGPDGYRH5RNTM4U2VJ3R/events.json","paper":"https://pith.science/paper/BDHTR7MG"},"agent_actions":{"view_html":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R","download_json":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R.json","view_paper":"https://pith.science/paper/BDHTR7MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03579&json=true","fetch_graph":"https://pith.science/api/pith-number/BDHTR7MGPDGYRH5RNTM4U2VJ3R/graph.json","fetch_events":"https://pith.science/api/pith-number/BDHTR7MGPDGYRH5RNTM4U2VJ3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/action/storage_attestation","attest_author":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/action/author_attestation","sign_citation":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/action/citation_signature","submit_replication":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/action/replication_record"}},"created_at":"2026-05-18T00:14:40.360645+00:00","updated_at":"2026-05-18T00:14:40.360645+00:00"}