{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DCYE5A7QAEMPDQYGAVDERKP37J","short_pith_number":"pith:DCYE5A7Q","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"},"canonical_sha256":"18b04e83f00118f1c306054648a9fbfa791016f89c75731e4a780aed133a5f8d","source":{"kind":"arxiv","id":"1203.0666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0666","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0666v1","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0666","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"DCYE5A7QAEMP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DCYE5A7QAEMPDQYG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DCYE5A7Q","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DCYE5A7QAEMPDQYGAVDERKP37J","target":"record","payload":{"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"},"canonical_sha256":"18b04e83f00118f1c306054648a9fbfa791016f89c75731e4a780aed133a5f8d","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"},"source_kind":"arxiv","source_id":"1203.0666","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-05-18T04:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlHL6VIIYnX10xBjduwSkKhmM5IueqX3LDnT2mMBb00b1iKEMouBovsEHKIpb8NsEGzRazQD8EgICKTCwoE1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:31:49.749788Z"},"content_sha256":"2fb7e638416bd3996b7beacc4673a03d9807accafb39e20d8b921832955ba535","schema_version":"1.0","event_id":"sha256:2fb7e638416bd3996b7beacc4673a03d9807accafb39e20d8b921832955ba535"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DCYE5A7QAEMPDQYGAVDERKP37J","target":"graph","payload":{"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"},"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-18T04:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjxkB6S9AUTRrD+z0crr8gzJaJ7RdiLqW5LdmGG0Kz4bre4Xs0HS073aEmQPDeWHC2mlfv9KE8MFVEH/ZS3lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:31:49.750241Z"},"content_sha256":"48d7630055d5e9da0c7bd4c666b3798d57140a729ddeb14cb502f4b13dbac102","schema_version":"1.0","event_id":"sha256:48d7630055d5e9da0c7bd4c666b3798d57140a729ddeb14cb502f4b13dbac102"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/bundle.json","state_url":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCYE5A7QAEMPDQYGAVDERKP37J/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-07T15:31:49Z","links":{"resolver":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J","bundle":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/bundle.json","state":"https://pith.science/pith/DCYE5A7QAEMPDQYGAVDERKP37J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCYE5A7QAEMPDQYGAVDERKP37J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DCYE5A7QAEMPDQYGAVDERKP37J","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":"7b48ca50c402b0e8759c3a3ad322e6ee17009dd0b71c53f579a14715b0e8cc89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-03T17:22:43Z","title_canon_sha256":"36ec8dcbc66799dcabb8e5adaa96a0eea1de0cdc6f46270d96a723500826929d"},"schema_version":"1.0","source":{"id":"1203.0666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0666","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0666v1","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0666","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"DCYE5A7QAEMP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DCYE5A7QAEMPDQYG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DCYE5A7Q","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:48d7630055d5e9da0c7bd4c666b3798d57140a729ddeb14cb502f4b13dbac102","target":"graph","created_at":"2026-05-18T04:00:50Z","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 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","authors_text":"Chun-Ying Chiang, Hong-Gwa Yeh, Liang-Hao Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-03T17:22:43Z","title":"Target set selection problem for honeycomb networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0666","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:2fb7e638416bd3996b7beacc4673a03d9807accafb39e20d8b921832955ba535","target":"record","created_at":"2026-05-18T04:00:50Z","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":"7b48ca50c402b0e8759c3a3ad322e6ee17009dd0b71c53f579a14715b0e8cc89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-03T17:22:43Z","title_canon_sha256":"36ec8dcbc66799dcabb8e5adaa96a0eea1de0cdc6f46270d96a723500826929d"},"schema_version":"1.0","source":{"id":"1203.0666","kind":"arxiv","version":1}},"canonical_sha256":"18b04e83f00118f1c306054648a9fbfa791016f89c75731e4a780aed133a5f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18b04e83f00118f1c306054648a9fbfa791016f89c75731e4a780aed133a5f8d","first_computed_at":"2026-05-18T04:00:50.922006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:50.922006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vJI3jcSlTTnVemTr1zl/SXSd+kZercyjVn22PjepNwhIkuXN7PqL4GAwdYNFg6UTVdpMlr6cInmuE0UDzegcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:50.922568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fb7e638416bd3996b7beacc4673a03d9807accafb39e20d8b921832955ba535","sha256:48d7630055d5e9da0c7bd4c666b3798d57140a729ddeb14cb502f4b13dbac102"],"state_sha256":"7431965f2751881efb4411b8c842c4d9f5b4d2b13f164499d6bb927cbffc7f04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zpf+of3e1/Pou5pXIhXoldKXJjOmaaEkxlMzLffQVYn1whIjY5k4reD8yX2oTbSiuabfceT2sQVtitx5OSTNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:31:49.753777Z","bundle_sha256":"9c415d596116f42165ceb090cc9c0e464f5ed66b2a75d89f36ad1b1f33972b0e"}}