{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FTGUMGTZ2PG7NCSZTOJ5LZ4Y27","short_pith_number":"pith:FTGUMGTZ","canonical_record":{"source":{"id":"1112.1313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-06T15:25:42Z","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"title_canon_sha256":"bf8a5a7b7636473c49a7077754c2de0d7f524dfaba6af34b3b4fc9e8a2a15bce","abstract_canon_sha256":"51cc517c5620faa391ab4a4d8ee915b83bd09611c4d1317957fb93ad1bbf533f"},"schema_version":"1.0"},"canonical_sha256":"2ccd461a79d3cdf68a599b93d5e798d7f4a1bb6bb7f37a1a930f236b6b42760e","source":{"kind":"arxiv","id":"1112.1313","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1313","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1313v1","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1313","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"FTGUMGTZ2PG7","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTGUMGTZ2PG7NCSZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTGUMGTZ","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FTGUMGTZ2PG7NCSZTOJ5LZ4Y27","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-06T15:25:42Z","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"title_canon_sha256":"bf8a5a7b7636473c49a7077754c2de0d7f524dfaba6af34b3b4fc9e8a2a15bce","abstract_canon_sha256":"51cc517c5620faa391ab4a4d8ee915b83bd09611c4d1317957fb93ad1bbf533f"},"schema_version":"1.0"},"canonical_sha256":"2ccd461a79d3cdf68a599b93d5e798d7f4a1bb6bb7f37a1a930f236b6b42760e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.733996Z","signature_b64":"IZGwqU5EXqum4AaWP78N9Zj5PV7SftFtjujq85B7IFVVqnu4iqzG218j/919IUPETXgR2f3p3RCRKV2PUhuHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ccd461a79d3cdf68a599b93d5e798d7f4a1bb6bb7f37a1a930f236b6b42760e","last_reissued_at":"2026-05-18T02:21:27.733227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.733227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1313","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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJB7Q8BEGGpE/yUrGkQcGe2GaQ+fYrnPNy88V916qCap4h2leuyFk4ktxHAGGOq0KV5vOrf+wk5vqHl9T8B2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:02:27.698285Z"},"content_sha256":"1d5bebeabfc557f752b0d1836a68133c423069486546b2ba13a5c4abd1104826","schema_version":"1.0","event_id":"sha256:1d5bebeabfc557f752b0d1836a68133c423069486546b2ba13a5c4abd1104826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FTGUMGTZ2PG7NCSZTOJ5LZ4Y27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.SI"],"primary_cat":"math.CO","authors_text":"Chun-Ying Chiang, Hong-Gwa Yeh, Liang-Hao Huang, Wei-Ting Huang","submitted_at":"2011-12-06T15:25:42Z","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.\n  In a a viral marketing setting, social networks are modeled by graphs with potential customers of a new product as vertices and friend relationships as edges, where each vertex $v$ is assigned a threshold value $\\theta(v)$. The thresholds represent the different latent tendencies of customers (vertices) to buy the new product when their friend (neighbors) do.\n  Consider a repetitive process on social network $(G,\\theta)$ where each ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1313","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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4htxeiQWYOa34ddsRTMHd/Vv6RoL1cHrSgHeyjf214NAZQh+RurXtpprjulOiPABcHPWBn4kwqFIMGEpxqDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:02:27.699034Z"},"content_sha256":"95e9fb4acdc20a97730391a902516e6e193b89e0dd1a34e3463e1662c395b7d7","schema_version":"1.0","event_id":"sha256:95e9fb4acdc20a97730391a902516e6e193b89e0dd1a34e3463e1662c395b7d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27/bundle.json","state_url":"https://pith.science/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27/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-07T17:02:27Z","links":{"resolver":"https://pith.science/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27","bundle":"https://pith.science/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27/bundle.json","state":"https://pith.science/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTGUMGTZ2PG7NCSZTOJ5LZ4Y27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FTGUMGTZ2PG7NCSZTOJ5LZ4Y27","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":"51cc517c5620faa391ab4a4d8ee915b83bd09611c4d1317957fb93ad1bbf533f","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-06T15:25:42Z","title_canon_sha256":"bf8a5a7b7636473c49a7077754c2de0d7f524dfaba6af34b3b4fc9e8a2a15bce"},"schema_version":"1.0","source":{"id":"1112.1313","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1313","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1313v1","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1313","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"FTGUMGTZ2PG7","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTGUMGTZ2PG7NCSZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTGUMGTZ","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:95e9fb4acdc20a97730391a902516e6e193b89e0dd1a34e3463e1662c395b7d7","target":"graph","created_at":"2026-05-18T02:21:27Z","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.\n  In a a viral marketing setting, social networks are modeled by graphs with potential customers of a new product as vertices and friend relationships as edges, where each vertex $v$ is assigned a threshold value $\\theta(v)$. The thresholds represent the different latent tendencies of customers (vertices) to buy the new product when their friend (neighbors) do.\n  Consider a repetitive process on social network $(G,\\theta)$ where each ver","authors_text":"Chun-Ying Chiang, Hong-Gwa Yeh, Liang-Hao Huang, Wei-Ting Huang","cross_cats":["cs.DM","cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-06T15:25:42Z","title":"The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1313","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:1d5bebeabfc557f752b0d1836a68133c423069486546b2ba13a5c4abd1104826","target":"record","created_at":"2026-05-18T02:21:27Z","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":"51cc517c5620faa391ab4a4d8ee915b83bd09611c4d1317957fb93ad1bbf533f","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-06T15:25:42Z","title_canon_sha256":"bf8a5a7b7636473c49a7077754c2de0d7f524dfaba6af34b3b4fc9e8a2a15bce"},"schema_version":"1.0","source":{"id":"1112.1313","kind":"arxiv","version":1}},"canonical_sha256":"2ccd461a79d3cdf68a599b93d5e798d7f4a1bb6bb7f37a1a930f236b6b42760e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ccd461a79d3cdf68a599b93d5e798d7f4a1bb6bb7f37a1a930f236b6b42760e","first_computed_at":"2026-05-18T02:21:27.733227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:27.733227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IZGwqU5EXqum4AaWP78N9Zj5PV7SftFtjujq85B7IFVVqnu4iqzG218j/919IUPETXgR2f3p3RCRKV2PUhuHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:27.733996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1313","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d5bebeabfc557f752b0d1836a68133c423069486546b2ba13a5c4abd1104826","sha256:95e9fb4acdc20a97730391a902516e6e193b89e0dd1a34e3463e1662c395b7d7"],"state_sha256":"6557e00d11b5dfc20b973eb7b952c90236a3fad4c2acaef3e42ff1d2674e4e5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3KT3H6KW5VdT5znaAWct9U/KpHgHLb1sK0Ru5a7sHEZUwrX4ThsSLi6u+ldf6wCziHj7j7WkXHXHRGUMbVOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:02:27.702803Z","bundle_sha256":"205ac4ed4c511b807dd857d645d66f8e1acaeb819fb4a95e8566538857f2a7e3"}}