{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BDHTR7MGPDGYRH5RNTM4U2VJ3R","short_pith_number":"pith:BDHTR7MG","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"},"canonical_sha256":"08cf38fd8678cd889fb16cd9ca6aa9dc4e759b9fc2cc16b5c1e9e6bce1a9405f","source":{"kind":"arxiv","id":"1802.03579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03579","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03579v2","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03579","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"pith_short_12","alias_value":"BDHTR7MGPDGY","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BDHTR7MGPDGYRH5R","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BDHTR7MG","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BDHTR7MGPDGYRH5RNTM4U2VJ3R","target":"record","payload":{"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"},"canonical_sha256":"08cf38fd8678cd889fb16cd9ca6aa9dc4e759b9fc2cc16b5c1e9e6bce1a9405f","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"},"source_kind":"arxiv","source_id":"1802.03579","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:14:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqp++2LMjvLEFAwSCKvc0kYQ+XQC+VxFwoyKaxTJYDvHxB0ydcYvMwVSwlPldWn1vIL3RwYSVTHQ/18b0UCaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:23:00.209590Z"},"content_sha256":"a6b10fdc169fbcbee3e0d27c594a89fd03e56bbba53bcba8d5a193896da1b603","schema_version":"1.0","event_id":"sha256:a6b10fdc169fbcbee3e0d27c594a89fd03e56bbba53bcba8d5a193896da1b603"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BDHTR7MGPDGYRH5RNTM4U2VJ3R","target":"graph","payload":{"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"},"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:14:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2E6rR6uMDMrLAAe6PuZM4s0vdn6sptLEXMTSkd1gOn0yqpKLDIBKcgo6PCPlbbFZGjMmZQrsbtKL5AuIXLKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:23:00.210305Z"},"content_sha256":"62f4c979871a8d25f4df1fa5dcf0c46c5faead99ba51aa59d5d2f263027049d8","schema_version":"1.0","event_id":"sha256:62f4c979871a8d25f4df1fa5dcf0c46c5faead99ba51aa59d5d2f263027049d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/bundle.json","state_url":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/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-09T02:23:00Z","links":{"resolver":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R","bundle":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/bundle.json","state":"https://pith.science/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDHTR7MGPDGYRH5RNTM4U2VJ3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BDHTR7MGPDGYRH5RNTM4U2VJ3R","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":"2fd848dcc28579feed225d9aca89777f5baf37c1e790b5a6a0c5034ebee5bae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T12:48:48Z","title_canon_sha256":"caa2f4fe6fba027d5a9020ae7a4652008678a6252c4c0ea56ae0e95d043163a2"},"schema_version":"1.0","source":{"id":"1802.03579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03579","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03579v2","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03579","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"pith_short_12","alias_value":"BDHTR7MGPDGY","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BDHTR7MGPDGYRH5R","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BDHTR7MG","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:62f4c979871a8d25f4df1fa5dcf0c46c5faead99ba51aa59d5d2f263027049d8","target":"graph","created_at":"2026-05-18T00:14:40Z","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":"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 ","authors_text":"Boram Park, Shinya Fujita, Tadashi Sakuma, Tommy Jensen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T12:48:48Z","title":"On the weighted safe set problem on paths and cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03579","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:a6b10fdc169fbcbee3e0d27c594a89fd03e56bbba53bcba8d5a193896da1b603","target":"record","created_at":"2026-05-18T00:14:40Z","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":"2fd848dcc28579feed225d9aca89777f5baf37c1e790b5a6a0c5034ebee5bae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T12:48:48Z","title_canon_sha256":"caa2f4fe6fba027d5a9020ae7a4652008678a6252c4c0ea56ae0e95d043163a2"},"schema_version":"1.0","source":{"id":"1802.03579","kind":"arxiv","version":2}},"canonical_sha256":"08cf38fd8678cd889fb16cd9ca6aa9dc4e759b9fc2cc16b5c1e9e6bce1a9405f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08cf38fd8678cd889fb16cd9ca6aa9dc4e759b9fc2cc16b5c1e9e6bce1a9405f","first_computed_at":"2026-05-18T00:14:40.360552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:40.360552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KzR5cmsagWvFj68SNnP/7USOuI0LEq7VmDvp5YKRAFfraCviyCNOb+E/e2TX8KLD85L6odzJq//HGFaXGjOdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:40.361186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6b10fdc169fbcbee3e0d27c594a89fd03e56bbba53bcba8d5a193896da1b603","sha256:62f4c979871a8d25f4df1fa5dcf0c46c5faead99ba51aa59d5d2f263027049d8"],"state_sha256":"cd278a192ba0b5bfd805fbb1cc056f62dde2933798d3193e1342bd168151a78e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwNrasV5JezvdjmPvfSE7jdE5HAUP+iKmVquBnBRp8bY6lbcZ5KHAQ7tm993wv4rizhHFBdDzKB+w6kGfBsoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:23:00.214248Z","bundle_sha256":"de5afd4d3f874a5851eb51c632323153c2dd7afc5b015fa531899bb49ff91a60"}}