{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4FLTFLUVZLPKJGUYE2ZWQEUO7Z","short_pith_number":"pith:4FLTFLUV","canonical_record":{"source":{"id":"1111.6685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-29T04:22:33Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","cs.SI"],"title_canon_sha256":"5049ea23df453ef73b4e62d697c44f119a4b34d6f1ebd718e0f459b33930d87b","abstract_canon_sha256":"fa1dcf8061777ec81506f0b74c4d4e055c113b2038c0f76f436d56381774cd3e"},"schema_version":"1.0"},"canonical_sha256":"e15732ae95cadea49a9826b368128efe4c4b091fc58bb113aa6b2cede38da9bb","source":{"kind":"arxiv","id":"1111.6685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6685","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6685v1","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6685","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"4FLTFLUVZLPK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4FLTFLUVZLPKJGUY","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4FLTFLUV","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4FLTFLUVZLPKJGUYE2ZWQEUO7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-29T04:22:33Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","cs.SI"],"title_canon_sha256":"5049ea23df453ef73b4e62d697c44f119a4b34d6f1ebd718e0f459b33930d87b","abstract_canon_sha256":"fa1dcf8061777ec81506f0b74c4d4e055c113b2038c0f76f436d56381774cd3e"},"schema_version":"1.0"},"canonical_sha256":"e15732ae95cadea49a9826b368128efe4c4b091fc58bb113aa6b2cede38da9bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:28.750618Z","signature_b64":"ckf2gNO0PCTcZ/ddcfNUwRxAXI0MMMz513jTlSYjwtMBHPX+b9wa6WtE39ZQiU6u4g7CVJey6AtWtXdk9nCtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15732ae95cadea49a9826b368128efe4c4b091fc58bb113aa6b2cede38da9bb","last_reissued_at":"2026-05-18T04:07:28.750025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:28.750025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6685","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:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7e1Hd5ANNjRPK8YWVqgoSXO6M/NTdUeWPiVsQT33Z8XKdLqerMdR2Q8tGbNSQe7Uc3s86FW/uyoHrdC+0PaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:22:26.830259Z"},"content_sha256":"9997a8b9a2cf380c38de0a1040878737a29ec18eb8211a121a32e1d7c3047dea","schema_version":"1.0","event_id":"sha256:9997a8b9a2cf380c38de0a1040878737a29ec18eb8211a121a32e1d7c3047dea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4FLTFLUVZLPKJGUYE2ZWQEUO7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Results on the Target Set Selection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","cs.SI"],"primary_cat":"math.CO","authors_text":"Bo-Jr Li, Chun-Ying Chiang, Hong-Gwa Yeh, Jiaojiao Wu, Liang-Hao Huang","submitted_at":"2011-11-29T04:22:33Z","abstract_excerpt":"In this paper we consider a fundamental problem in the area of viral marketing, called T{\\scriptsize ARGET} S{\\scriptsize ET} S{\\scriptsize ELECTION} problem. We study the problem when the underlying graph is a block-cactus graph, a chordal graph or a Hamming graph. We show that if $G$ is a block-cactus graph, then the T{\\scriptsize ARGET} S{\\scriptsize ET} S{\\scriptsize ELECTION} problem can be solved in linear time, which generalizes Chen's result \\cite{chen2009} for trees, and the time complexity is much better than the algorithm in \\cite{treewidth} (for bounded treewidth graphs) when restr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6685","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:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwC99qcwioQ1zvS5UO+Q4i7RQkKdG1VmZiglwfjUIgX2ZYdRyNKE/SNkpk9Jb2XICk3QIV3IVMNgN4t1C4ekDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:22:26.830617Z"},"content_sha256":"9cb747b1a7fca59c27d6ed6a03da9774e03f1a5d2e8b45fee0ebcf2c765f69f9","schema_version":"1.0","event_id":"sha256:9cb747b1a7fca59c27d6ed6a03da9774e03f1a5d2e8b45fee0ebcf2c765f69f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z/bundle.json","state_url":"https://pith.science/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z/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-07T10:22:26Z","links":{"resolver":"https://pith.science/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z","bundle":"https://pith.science/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z/bundle.json","state":"https://pith.science/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FLTFLUVZLPKJGUYE2ZWQEUO7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4FLTFLUVZLPKJGUYE2ZWQEUO7Z","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":"fa1dcf8061777ec81506f0b74c4d4e055c113b2038c0f76f436d56381774cd3e","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-29T04:22:33Z","title_canon_sha256":"5049ea23df453ef73b4e62d697c44f119a4b34d6f1ebd718e0f459b33930d87b"},"schema_version":"1.0","source":{"id":"1111.6685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6685","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6685v1","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6685","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"4FLTFLUVZLPK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4FLTFLUVZLPKJGUY","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4FLTFLUV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:9cb747b1a7fca59c27d6ed6a03da9774e03f1a5d2e8b45fee0ebcf2c765f69f9","target":"graph","created_at":"2026-05-18T04:07:28Z","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":"In this paper we consider a fundamental problem in the area of viral marketing, called T{\\scriptsize ARGET} S{\\scriptsize ET} S{\\scriptsize ELECTION} problem. We study the problem when the underlying graph is a block-cactus graph, a chordal graph or a Hamming graph. We show that if $G$ is a block-cactus graph, then the T{\\scriptsize ARGET} S{\\scriptsize ET} S{\\scriptsize ELECTION} problem can be solved in linear time, which generalizes Chen's result \\cite{chen2009} for trees, and the time complexity is much better than the algorithm in \\cite{treewidth} (for bounded treewidth graphs) when restr","authors_text":"Bo-Jr Li, Chun-Ying Chiang, Hong-Gwa Yeh, Jiaojiao Wu, Liang-Hao Huang","cross_cats":["cs.CC","cs.DM","cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-29T04:22:33Z","title":"Some Results on the Target Set Selection Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6685","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:9997a8b9a2cf380c38de0a1040878737a29ec18eb8211a121a32e1d7c3047dea","target":"record","created_at":"2026-05-18T04:07:28Z","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":"fa1dcf8061777ec81506f0b74c4d4e055c113b2038c0f76f436d56381774cd3e","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-29T04:22:33Z","title_canon_sha256":"5049ea23df453ef73b4e62d697c44f119a4b34d6f1ebd718e0f459b33930d87b"},"schema_version":"1.0","source":{"id":"1111.6685","kind":"arxiv","version":1}},"canonical_sha256":"e15732ae95cadea49a9826b368128efe4c4b091fc58bb113aa6b2cede38da9bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e15732ae95cadea49a9826b368128efe4c4b091fc58bb113aa6b2cede38da9bb","first_computed_at":"2026-05-18T04:07:28.750025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:28.750025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ckf2gNO0PCTcZ/ddcfNUwRxAXI0MMMz513jTlSYjwtMBHPX+b9wa6WtE39ZQiU6u4g7CVJey6AtWtXdk9nCtAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:28.750618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9997a8b9a2cf380c38de0a1040878737a29ec18eb8211a121a32e1d7c3047dea","sha256:9cb747b1a7fca59c27d6ed6a03da9774e03f1a5d2e8b45fee0ebcf2c765f69f9"],"state_sha256":"15fa17b1e8b3782a9fff3d161b0b2824e4e09d5ca53e5a3a86eea293630c86d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lr9buF9bX5095sl/dX/k36QKftS3mJylRjW6YZSgiN1MKEmOxV6oyY5Ag+MCLPbulOCXd4OPzZWVbobwWR4XCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:22:26.832475Z","bundle_sha256":"178b6d044aee48e8b7efa753a15bffde09b7f1b4a1f9d5a309c6576753912c00"}}