{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LDB5N3ABNTZUS6VWQQN7K63LLT","short_pith_number":"pith:LDB5N3AB","canonical_record":{"source":{"id":"1806.06326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-17T02:02:51Z","cross_cats_sorted":[],"title_canon_sha256":"c8200298d03b7e0f2c0d078aa4a6ef5efceac1862a442503d46058dae821822e","abstract_canon_sha256":"e4d13b56b82b242bc6d270298c2ac51440ee9133da22e1b40daf988e8555eac7"},"schema_version":"1.0"},"canonical_sha256":"58c3d6ec016cf3497ab6841bf57b6b5cc21213407e224feed4867390f88cbff2","source":{"kind":"arxiv","id":"1806.06326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06326","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06326v1","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06326","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"pith_short_12","alias_value":"LDB5N3ABNTZU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LDB5N3ABNTZUS6VW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LDB5N3AB","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LDB5N3ABNTZUS6VWQQN7K63LLT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-17T02:02:51Z","cross_cats_sorted":[],"title_canon_sha256":"c8200298d03b7e0f2c0d078aa4a6ef5efceac1862a442503d46058dae821822e","abstract_canon_sha256":"e4d13b56b82b242bc6d270298c2ac51440ee9133da22e1b40daf988e8555eac7"},"schema_version":"1.0"},"canonical_sha256":"58c3d6ec016cf3497ab6841bf57b6b5cc21213407e224feed4867390f88cbff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:02.871256Z","signature_b64":"SFiZmt81Z2ghOUXJysxfvpP0MQL9nIBiAw+nYDxJYc2gFklSZi49szLSKvjMzGHQXlj90TqJWnpNLkZUz6+mDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c3d6ec016cf3497ab6841bf57b6b5cc21213407e224feed4867390f88cbff2","last_reissued_at":"2026-05-18T00:13:02.870591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:02.870591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06326","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-18T00:13:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNlqW+1/ZpeScKRUc+sILi9q0yupRgdmJrUxpIRZpJO18GzCwQN2g16BTNF/IOOh4/nDQbMNLGH3k3DkqmieAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:41:12.130269Z"},"content_sha256":"1f8ea1ce9c21d33452cd7be2a3118c9441fc18a64a6cab16dc458734266e15ea","schema_version":"1.0","event_id":"sha256:1f8ea1ce9c21d33452cd7be2a3118c9441fc18a64a6cab16dc458734266e15ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LDB5N3ABNTZUS6VWQQN7K63LLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Gradient Tree Boosting based Approach to Rumor Detecting on Sina Weibo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bo Yang, Xiao Xiong, Zhongfeng Kang","submitted_at":"2018-06-17T02:02:51Z","abstract_excerpt":"Rumor detecting on microblogging platforms such as Sina Weibo is a crucial issue. Most existing rumor detecting algorithms require a lot of propagation data for model training, thus they do not have good detecting accuracy at the early stage after a rumor message is posted. In this paper, we propose to use gradient tree boosting (GTB) approach to rumor detecting, based on which a rumor detecting algorithm is developed. At the same time, the GTB-based approach makes it easy to conduct feature selection, and a feature selection algorithm is developed. Experiments on a widely used dataset of Sina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06326","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-18T00:13:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59/dBKlXaGuE+80sXaORO4SKMA99sLZqilkKBVDdOhZH4bVWFmoDh3V8mFVdMPomB49t5+R0/AoFtfDP57exBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:41:12.130621Z"},"content_sha256":"e864e5a7c4b9666ec013d9ac58d254279d1933b6f338de80b2b6f6b33c2586fa","schema_version":"1.0","event_id":"sha256:e864e5a7c4b9666ec013d9ac58d254279d1933b6f338de80b2b6f6b33c2586fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDB5N3ABNTZUS6VWQQN7K63LLT/bundle.json","state_url":"https://pith.science/pith/LDB5N3ABNTZUS6VWQQN7K63LLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDB5N3ABNTZUS6VWQQN7K63LLT/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-01T18:41:12Z","links":{"resolver":"https://pith.science/pith/LDB5N3ABNTZUS6VWQQN7K63LLT","bundle":"https://pith.science/pith/LDB5N3ABNTZUS6VWQQN7K63LLT/bundle.json","state":"https://pith.science/pith/LDB5N3ABNTZUS6VWQQN7K63LLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDB5N3ABNTZUS6VWQQN7K63LLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LDB5N3ABNTZUS6VWQQN7K63LLT","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":"e4d13b56b82b242bc6d270298c2ac51440ee9133da22e1b40daf988e8555eac7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-17T02:02:51Z","title_canon_sha256":"c8200298d03b7e0f2c0d078aa4a6ef5efceac1862a442503d46058dae821822e"},"schema_version":"1.0","source":{"id":"1806.06326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06326","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06326v1","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06326","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"pith_short_12","alias_value":"LDB5N3ABNTZU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LDB5N3ABNTZUS6VW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LDB5N3AB","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:e864e5a7c4b9666ec013d9ac58d254279d1933b6f338de80b2b6f6b33c2586fa","target":"graph","created_at":"2026-05-18T00:13:02Z","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":"Rumor detecting on microblogging platforms such as Sina Weibo is a crucial issue. Most existing rumor detecting algorithms require a lot of propagation data for model training, thus they do not have good detecting accuracy at the early stage after a rumor message is posted. In this paper, we propose to use gradient tree boosting (GTB) approach to rumor detecting, based on which a rumor detecting algorithm is developed. At the same time, the GTB-based approach makes it easy to conduct feature selection, and a feature selection algorithm is developed. Experiments on a widely used dataset of Sina","authors_text":"Bo Yang, Xiao Xiong, Zhongfeng Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-17T02:02:51Z","title":"A Gradient Tree Boosting based Approach to Rumor Detecting on Sina Weibo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06326","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:1f8ea1ce9c21d33452cd7be2a3118c9441fc18a64a6cab16dc458734266e15ea","target":"record","created_at":"2026-05-18T00:13:02Z","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":"e4d13b56b82b242bc6d270298c2ac51440ee9133da22e1b40daf988e8555eac7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-17T02:02:51Z","title_canon_sha256":"c8200298d03b7e0f2c0d078aa4a6ef5efceac1862a442503d46058dae821822e"},"schema_version":"1.0","source":{"id":"1806.06326","kind":"arxiv","version":1}},"canonical_sha256":"58c3d6ec016cf3497ab6841bf57b6b5cc21213407e224feed4867390f88cbff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c3d6ec016cf3497ab6841bf57b6b5cc21213407e224feed4867390f88cbff2","first_computed_at":"2026-05-18T00:13:02.870591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:02.870591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SFiZmt81Z2ghOUXJysxfvpP0MQL9nIBiAw+nYDxJYc2gFklSZi49szLSKvjMzGHQXlj90TqJWnpNLkZUz6+mDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:02.871256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f8ea1ce9c21d33452cd7be2a3118c9441fc18a64a6cab16dc458734266e15ea","sha256:e864e5a7c4b9666ec013d9ac58d254279d1933b6f338de80b2b6f6b33c2586fa"],"state_sha256":"80a1de586710b1e358b958a0184f24cd932a577e6d9c261ed3b7a0b8f81cf950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw4rHfw6kCBt4ayvNrzggf7jHQYMf8/gCPNc7/mcDOi6Hq8IX/Wp0T6UwbRgNbGdIipwbWyuLgFv5d88V1hVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:41:12.132453Z","bundle_sha256":"ba7e00b32820d504c4e9f42e80e35b23ef4a4c872a3d8f79d7c399bed02bdb53"}}