{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DCYE5A7QAEMPDQYGAVDERKP37J","short_pith_number":"pith:DCYE5A7Q","schema_version":"1.0","canonical_sha256":"18b04e83f00118f1c306054648a9fbfa791016f89c75731e4a780aed133a5f8d","source":{"kind":"arxiv","id":"1203.0666","version":1},"attestation_state":"computed","paper":{"title":"Target set selection problem for honeycomb networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Chun-Ying Chiang, Hong-Gwa Yeh, Liang-Hao Huang","submitted_at":"2012-03-03T17:22:43Z","abstract_excerpt":"Let $G$ be a graph with a threshold function $\\theta:V(G)\\rightarrow \\mathbb{N}$ such that $1\\leq \\theta(v)\\leq d_G(v)$ for every vertex $v$ of $G$, where $d_G(v)$ is the degree of $v$ in $G$. Suppose we are given a target set $S\\subseteq V(G)$. The paper considers the following repetitive process on $G$. At time step 0 the vertices of $S$ are colored black and the other vertices are colored white. After that, at each time step $t>0$, the colors of white vertices (if any) are updated according to the following rule. All white vertices $v$ that have at least $\\theta(v)$ black neighbors at the t"},"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":"1203.0666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-03T17:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"36ec8dcbc66799dcabb8e5adaa96a0eea1de0cdc6f46270d96a723500826929d","abstract_canon_sha256":"7b48ca50c402b0e8759c3a3ad322e6ee17009dd0b71c53f579a14715b0e8cc89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:50.922568Z","signature_b64":"vJI3jcSlTTnVemTr1zl/SXSd+kZercyjVn22PjepNwhIkuXN7PqL4GAwdYNFg6UTVdpMlr6cInmuE0UDzegcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18b04e83f00118f1c306054648a9fbfa791016f89c75731e4a780aed133a5f8d","last_reissued_at":"2026-05-18T04:00:50.922006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:50.922006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Target set selection problem for honeycomb networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Chun-Ying Chiang, Hong-Gwa Yeh, Liang-Hao Huang","submitted_at":"2012-03-03T17:22:43Z","abstract_excerpt":"Let $G$ be a graph with a threshold function $\\theta:V(G)\\rightarrow \\mathbb{N}$ such that $1\\leq \\theta(v)\\leq d_G(v)$ for every vertex $v$ of $G$, where $d_G(v)$ is the degree of $v$ in $G$. Suppose we are given a target set $S\\subseteq V(G)$. The paper considers the following repetitive process on $G$. At time step 0 the vertices of $S$ are colored black and the other vertices are colored white. After that, at each time step $t>0$, the colors of white vertices (if any) are updated according to the following rule. All white vertices $v$ that have at least $\\theta(v)$ black neighbors at the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0666","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":"1203.0666","created_at":"2026-05-18T04:00:50.922093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0666v1","created_at":"2026-05-18T04:00:50.922093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0666","created_at":"2026-05-18T04:00:50.922093+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCYE5A7QAEMP","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCYE5A7QAEMPDQYG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCYE5A7Q","created_at":"2026-05-18T12:27:01.376967+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/DCYE5A7QAEMPDQYGAVDERKP37J","json":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J.json","graph_json":"https://pith.science/api/pith-number/DCYE5A7QAEMPDQYGAVDERKP37J/graph.json","events_json":"https://pith.science/api/pith-number/DCYE5A7QAEMPDQYGAVDERKP37J/events.json","paper":"https://pith.science/paper/DCYE5A7Q"},"agent_actions":{"view_html":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J","download_json":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J.json","view_paper":"https://pith.science/paper/DCYE5A7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0666&json=true","fetch_graph":"https://pith.science/api/pith-number/DCYE5A7QAEMPDQYGAVDERKP37J/graph.json","fetch_events":"https://pith.science/api/pith-number/DCYE5A7QAEMPDQYGAVDERKP37J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/action/storage_attestation","attest_author":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/action/author_attestation","sign_citation":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/action/citation_signature","submit_replication":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/action/replication_record"}},"created_at":"2026-05-18T04:00:50.922093+00:00","updated_at":"2026-05-18T04:00:50.922093+00:00"}