{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KMT3J3RRXA2JH2C4UJP2PTSUYL","short_pith_number":"pith:KMT3J3RR","canonical_record":{"source":{"id":"1908.06664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-19T09:33:26Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae8c69ce9926f91bd1fde98373d8063a26e688cb27d0723d6dd3a25ab32bd8b2","abstract_canon_sha256":"ec3120621e51d5a3f70d8f299f945eabfdae02452e300d336eb547409810ea9c"},"schema_version":"1.0"},"canonical_sha256":"5327b4ee31b83493e85ca25fa7ce54c2e64d502bc36443812f59d59c93b3bb5b","source":{"kind":"arxiv","id":"1908.06664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06664","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06664v1","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06664","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"KMT3J3RRXA2J","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_16","alias_value":"KMT3J3RRXA2JH2C4","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_8","alias_value":"KMT3J3RR","created_at":"2026-07-04T23:58:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KMT3J3RRXA2JH2C4UJP2PTSUYL","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-19T09:33:26Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae8c69ce9926f91bd1fde98373d8063a26e688cb27d0723d6dd3a25ab32bd8b2","abstract_canon_sha256":"ec3120621e51d5a3f70d8f299f945eabfdae02452e300d336eb547409810ea9c"},"schema_version":"1.0"},"canonical_sha256":"5327b4ee31b83493e85ca25fa7ce54c2e64d502bc36443812f59d59c93b3bb5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:18.321271Z","signature_b64":"PXAYMnfXU044jRQosSooqPFscMaDZy/3GjLZr2BBADlc/g+rkMX1qF1cPQBXWPpNip7dk8mWvIEtZzzQFvumAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5327b4ee31b83493e85ca25fa7ce54c2e64d502bc36443812f59d59c93b3bb5b","last_reissued_at":"2026-07-04T23:58:18.320903Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:18.320903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06664","source_version":1,"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-07-04T23:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kb6gH+P953QKGXJH4RsNyJ6FCSdEXj6DlxRwjVzqaBz2ZZjtqPXNGvF8e+t/TljFICaJO87IsKUcJpJfEdFtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:05:19.045170Z"},"content_sha256":"ff6ad84ff2e4efc5fe939919ab1cb4b419ff37f6d47b8663c8ca347c2ce6407a","schema_version":"1.0","event_id":"sha256:ff6ad84ff2e4efc5fe939919ab1cb4b419ff37f6d47b8663c8ca347c2ce6407a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KMT3J3RRXA2JH2C4UJP2PTSUYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe sets in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Anders Yeo, J{\\o}rgen Bang-Jensen, Shinya Fujita, Yandong Bai","submitted_at":"2019-08-19T09:33:26Z","abstract_excerpt":"A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\\it safe set} if \\begin{itemize}\n  \\item[(i)] for every strongly connected component $M$ of $D-S$, there exists a strongly connected component $N$ of $D[S]$ such that there exists an arc from $M$ to $N$; and \\item[(ii)] for every strongly connected component $M$ of $D-S$ and every strongly connected component $N$ of $D[S]$, we have $|M|\\leq |N|$ whenever there exists an arc from $M$ to $N$. \\end{itemize} In the case of acyclic digraphs a set $X$ of vertices is a safe set precisely when $X$ is an {\\it in-dominating set}, that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06664","kind":"arxiv","version":1},"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/1908.06664/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"},"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-07-04T23:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNt7z7/w0sMCUx1+1/VkTZi1/0iTSAhK6v/6j42xQOiJYL0oOunUG8xd4fbDG8aw4Dyumm5jVDhA2CvzX8vDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:05:19.046018Z"},"content_sha256":"fab246c93061fad74cb570244daa05b329924df05d5ec837a89289f73210553f","schema_version":"1.0","event_id":"sha256:fab246c93061fad74cb570244daa05b329924df05d5ec837a89289f73210553f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL/bundle.json","state_url":"https://pith.science/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL/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-16T05:05:19Z","links":{"resolver":"https://pith.science/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL","bundle":"https://pith.science/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL/bundle.json","state":"https://pith.science/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMT3J3RRXA2JH2C4UJP2PTSUYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KMT3J3RRXA2JH2C4UJP2PTSUYL","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":"ec3120621e51d5a3f70d8f299f945eabfdae02452e300d336eb547409810ea9c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-19T09:33:26Z","title_canon_sha256":"ae8c69ce9926f91bd1fde98373d8063a26e688cb27d0723d6dd3a25ab32bd8b2"},"schema_version":"1.0","source":{"id":"1908.06664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06664","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06664v1","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06664","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"KMT3J3RRXA2J","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_16","alias_value":"KMT3J3RRXA2JH2C4","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_8","alias_value":"KMT3J3RR","created_at":"2026-07-04T23:58:18Z"}],"graph_snapshots":[{"event_id":"sha256:fab246c93061fad74cb570244daa05b329924df05d5ec837a89289f73210553f","target":"graph","created_at":"2026-07-04T23:58:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\\it safe set} if \\begin{itemize}\n  \\item[(i)] for every strongly connected component $M$ of $D-S$, there exists a strongly connected component $N$ of $D[S]$ such that there exists an arc from $M$ to $N$; and \\item[(ii)] for every strongly connected component $M$ of $D-S$ and every strongly connected component $N$ of $D[S]$, we have $|M|\\leq |N|$ whenever there exists an arc from $M$ to $N$. \\end{itemize} In the case of acyclic digraphs a set $X$ of vertices is a safe set precisely when $X$ is an {\\it in-dominating set}, that ","authors_text":"Anders Yeo, J{\\o}rgen Bang-Jensen, Shinya Fujita, Yandong Bai","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-19T09:33:26Z","title":"Safe sets in digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06664","kind":"arxiv","version":1},"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:ff6ad84ff2e4efc5fe939919ab1cb4b419ff37f6d47b8663c8ca347c2ce6407a","target":"record","created_at":"2026-07-04T23:58:18Z","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":"ec3120621e51d5a3f70d8f299f945eabfdae02452e300d336eb547409810ea9c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-19T09:33:26Z","title_canon_sha256":"ae8c69ce9926f91bd1fde98373d8063a26e688cb27d0723d6dd3a25ab32bd8b2"},"schema_version":"1.0","source":{"id":"1908.06664","kind":"arxiv","version":1}},"canonical_sha256":"5327b4ee31b83493e85ca25fa7ce54c2e64d502bc36443812f59d59c93b3bb5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5327b4ee31b83493e85ca25fa7ce54c2e64d502bc36443812f59d59c93b3bb5b","first_computed_at":"2026-07-04T23:58:18.320903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:18.320903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PXAYMnfXU044jRQosSooqPFscMaDZy/3GjLZr2BBADlc/g+rkMX1qF1cPQBXWPpNip7dk8mWvIEtZzzQFvumAg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:18.321271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff6ad84ff2e4efc5fe939919ab1cb4b419ff37f6d47b8663c8ca347c2ce6407a","sha256:fab246c93061fad74cb570244daa05b329924df05d5ec837a89289f73210553f"],"state_sha256":"6941da131f3df4a4905502b0b5ca6495f8d9aa35cab67a133ee11873b9d79034"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RR8BNA+pCZO98hdHsLE1EG4s+fUP+6bbuXfWXirEridF4JpkaDPxn2nG8so6qWTun5Pch9HQ54CTAl2EBFlfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:05:19.052987Z","bundle_sha256":"0401a8e2ccba5876b48fe471161bbeaec835aa31cfa9e0b4d5e943d0a827b65b"}}