{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KDP5KB4WB2CZLTVAJFVJNGCQV6","short_pith_number":"pith:KDP5KB4W","schema_version":"1.0","canonical_sha256":"50dfd507960e8595cea0496a969850af8acb580293e889c254d201f826d84cb8","source":{"kind":"arxiv","id":"1508.02594","version":1},"attestation_state":"computed","paper":{"title":"On the safe set of Cartesian product of two complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Bumtle Kang, Suh-Ryung Kim","submitted_at":"2015-08-11T13:50:58Z","abstract_excerpt":"For a connected graph $G$, a vertex subset $S$ of $V(G)$ is a safe set if for every component $C$ of the subgraph of $G$ induced by $S$, $|C| \\ge |D|$ holds for every component $D$ of $G-S$ such that there exists an edge between $C$ and $D$, and, in particular, if the subgraph induced by $S$ is connected, then $S$ is called a connected safe set. For a connected graph $G$, the safe number and the connected safe number of $G$ are the minimum among sizes of the safe sets and the minimum among sizes of the connected safe sets, respectively, of $G$. Fujita et al. introduced these notions in connect"},"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":"1508.02594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T13:50:58Z","cross_cats_sorted":[],"title_canon_sha256":"334eff7ed89af51d609059285a19adb7dda474ed9ea15983afc0596fbe80bfd1","abstract_canon_sha256":"e604685fc90bff3807ba17e154c763b5d648cd772fca055e11c2d9bec42aa048"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:28.777968Z","signature_b64":"2pzdf3Txytw5pCW7aSyQ5UI6hDnlE+gwwT/GHQDT9hI7w7MWxEoOPB0CfAkiN/xJJp8jnbUylVeOsrWi1ourAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50dfd507960e8595cea0496a969850af8acb580293e889c254d201f826d84cb8","last_reissued_at":"2026-05-18T01:35:28.777379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:28.777379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the safe set of Cartesian product of two complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Bumtle Kang, Suh-Ryung Kim","submitted_at":"2015-08-11T13:50:58Z","abstract_excerpt":"For a connected graph $G$, a vertex subset $S$ of $V(G)$ is a safe set if for every component $C$ of the subgraph of $G$ induced by $S$, $|C| \\ge |D|$ holds for every component $D$ of $G-S$ such that there exists an edge between $C$ and $D$, and, in particular, if the subgraph induced by $S$ is connected, then $S$ is called a connected safe set. For a connected graph $G$, the safe number and the connected safe number of $G$ are the minimum among sizes of the safe sets and the minimum among sizes of the connected safe sets, respectively, of $G$. Fujita et al. introduced these notions in connect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02594","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":""},"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":"1508.02594","created_at":"2026-05-18T01:35:28.777478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02594v1","created_at":"2026-05-18T01:35:28.777478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02594","created_at":"2026-05-18T01:35:28.777478+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDP5KB4WB2CZ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDP5KB4WB2CZLTVA","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDP5KB4W","created_at":"2026-05-18T12:29:27.538025+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/KDP5KB4WB2CZLTVAJFVJNGCQV6","json":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6.json","graph_json":"https://pith.science/api/pith-number/KDP5KB4WB2CZLTVAJFVJNGCQV6/graph.json","events_json":"https://pith.science/api/pith-number/KDP5KB4WB2CZLTVAJFVJNGCQV6/events.json","paper":"https://pith.science/paper/KDP5KB4W"},"agent_actions":{"view_html":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6","download_json":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6.json","view_paper":"https://pith.science/paper/KDP5KB4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02594&json=true","fetch_graph":"https://pith.science/api/pith-number/KDP5KB4WB2CZLTVAJFVJNGCQV6/graph.json","fetch_events":"https://pith.science/api/pith-number/KDP5KB4WB2CZLTVAJFVJNGCQV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6/action/storage_attestation","attest_author":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6/action/author_attestation","sign_citation":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6/action/citation_signature","submit_replication":"https://pith.science/pith/KDP5KB4WB2CZLTVAJFVJNGCQV6/action/replication_record"}},"created_at":"2026-05-18T01:35:28.777478+00:00","updated_at":"2026-05-18T01:35:28.777478+00:00"}