{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WPMHF5EEOFQDI23GCP4FBUGSS5","short_pith_number":"pith:WPMHF5EE","schema_version":"1.0","canonical_sha256":"b3d872f4847160346b6613f850d0d2976bc8b40c6e67999aa7232d5b139cb459","source":{"kind":"arxiv","id":"2410.13512","version":1},"attestation_state":"computed","paper":{"title":"A Proposal for Uncovering Hidden Social Bots via Genetic Similarity","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Angelo Spognardi, Edoardo Allegrini, Edoardo Di Paolo, Marinella Petrocchi","submitted_at":"2024-10-17T13:01:00Z","abstract_excerpt":"Social media platforms face an ongoing challenge in combating the proliferation of social bots, automated accounts that are also known to distort public opinion and support the spread of disinformation. Over the years, social bots have evolved greatly, often becoming indistinguishable from real users, and more recently, families of bots have been identified that are powered by Large Language Models to produce content for posting. We suggest an idea to classify social users as bots or not using genetic similarity algorithms. These algorithms provide an adaptive method for analyzing user behavio"},"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":"2410.13512","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-10-17T13:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"a83b2d5e5cf8c17944cb31d5c634452a3dc82b9c9c5b54bff1f4c283c60e814b","abstract_canon_sha256":"e0225234b4748e8efc46a32e1264d151c9a7fd27b5a9c58608629871161a5dc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:02.083780Z","signature_b64":"Es8B6HOmcUaLhfP6gZCiEJ5Bev1+OwlDIPYYgOnhMCztWrBtoYmmT0KyOEqmk2b9y+AJWEH0eW/aL/XTuQ4fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d872f4847160346b6613f850d0d2976bc8b40c6e67999aa7232d5b139cb459","last_reissued_at":"2026-07-05T09:22:02.083361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:02.083361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proposal for Uncovering Hidden Social Bots via Genetic Similarity","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Angelo Spognardi, Edoardo Allegrini, Edoardo Di Paolo, Marinella Petrocchi","submitted_at":"2024-10-17T13:01:00Z","abstract_excerpt":"Social media platforms face an ongoing challenge in combating the proliferation of social bots, automated accounts that are also known to distort public opinion and support the spread of disinformation. Over the years, social bots have evolved greatly, often becoming indistinguishable from real users, and more recently, families of bots have been identified that are powered by Large Language Models to produce content for posting. We suggest an idea to classify social users as bots or not using genetic similarity algorithms. These algorithms provide an adaptive method for analyzing user behavio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13512","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.13512/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.13512","created_at":"2026-07-05T09:22:02.083420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13512v1","created_at":"2026-07-05T09:22:02.083420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13512","created_at":"2026-07-05T09:22:02.083420+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPMHF5EEOFQD","created_at":"2026-07-05T09:22:02.083420+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPMHF5EEOFQDI23G","created_at":"2026-07-05T09:22:02.083420+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPMHF5EE","created_at":"2026-07-05T09:22:02.083420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20503","citing_title":"BotHash: Efficient and Training-Free Bot Detection Through Approximate Nearest Neighbor","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5","json":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5.json","graph_json":"https://pith.science/api/pith-number/WPMHF5EEOFQDI23GCP4FBUGSS5/graph.json","events_json":"https://pith.science/api/pith-number/WPMHF5EEOFQDI23GCP4FBUGSS5/events.json","paper":"https://pith.science/paper/WPMHF5EE"},"agent_actions":{"view_html":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5","download_json":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5.json","view_paper":"https://pith.science/paper/WPMHF5EE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13512&json=true","fetch_graph":"https://pith.science/api/pith-number/WPMHF5EEOFQDI23GCP4FBUGSS5/graph.json","fetch_events":"https://pith.science/api/pith-number/WPMHF5EEOFQDI23GCP4FBUGSS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5/action/storage_attestation","attest_author":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5/action/author_attestation","sign_citation":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5/action/citation_signature","submit_replication":"https://pith.science/pith/WPMHF5EEOFQDI23GCP4FBUGSS5/action/replication_record"}},"created_at":"2026-07-05T09:22:02.083420+00:00","updated_at":"2026-07-05T09:22:02.083420+00:00"}