{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SOZFH4PV5W7UDMNW4C5ZB46QWO","short_pith_number":"pith:SOZFH4PV","schema_version":"1.0","canonical_sha256":"93b253f1f5edbf41b1b6e0bb90f3d0b38b847bf28fce6713ec62e0cfad250108","source":{"kind":"arxiv","id":"2409.08963","version":1},"attestation_state":"computed","paper":{"title":"Safeguarding Decentralized Social Media: LLM Agents for Automating Community Rule Compliance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.HC","physics.soc-ph"],"primary_cat":"cs.CY","authors_text":"Andrea Tagarelli, Lucio La Cava","submitted_at":"2024-09-13T16:29:25Z","abstract_excerpt":"Ensuring content compliance with community guidelines is crucial for maintaining healthy online social environments. However, traditional human-based compliance checking struggles with scaling due to the increasing volume of user-generated content and a limited number of moderators. Recent advancements in Natural Language Understanding demonstrated by Large Language Models unlock new opportunities for automated content compliance verification. This work evaluates six AI-agents built on Open-LLMs for automated rule compliance checking in Decentralized Social Networks, a challenging environment "},"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":"2409.08963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CY","submitted_at":"2024-09-13T16:29:25Z","cross_cats_sorted":["cs.CL","cs.HC","physics.soc-ph"],"title_canon_sha256":"92acd4515085aea0602391c59bdbbb79b757d2aa5eaebc8c49356204254d61d8","abstract_canon_sha256":"8caf49d5de4b38cecaaa395664dc0b26ef964455ec432c8b23620f45bc4bba56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:50.275099Z","signature_b64":"ujbSXW65q8C2Hfiw626IHSs9z7j/cxBWiDAgHvM0TS0bqteQSku3Dswqj+cyXIAtZ/w5TjIx+ufI3XVPbOtsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b253f1f5edbf41b1b6e0bb90f3d0b38b847bf28fce6713ec62e0cfad250108","last_reissued_at":"2026-07-05T09:06:50.274767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:50.274767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safeguarding Decentralized Social Media: LLM Agents for Automating Community Rule Compliance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.HC","physics.soc-ph"],"primary_cat":"cs.CY","authors_text":"Andrea Tagarelli, Lucio La Cava","submitted_at":"2024-09-13T16:29:25Z","abstract_excerpt":"Ensuring content compliance with community guidelines is crucial for maintaining healthy online social environments. However, traditional human-based compliance checking struggles with scaling due to the increasing volume of user-generated content and a limited number of moderators. Recent advancements in Natural Language Understanding demonstrated by Large Language Models unlock new opportunities for automated content compliance verification. This work evaluates six AI-agents built on Open-LLMs for automated rule compliance checking in Decentralized Social Networks, a challenging environment "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08963","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/2409.08963/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":"2409.08963","created_at":"2026-07-05T09:06:50.274822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08963v1","created_at":"2026-07-05T09:06:50.274822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08963","created_at":"2026-07-05T09:06:50.274822+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOZFH4PV5W7U","created_at":"2026-07-05T09:06:50.274822+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOZFH4PV5W7UDMNW","created_at":"2026-07-05T09:06:50.274822+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOZFH4PV","created_at":"2026-07-05T09:06:50.274822+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04389","citing_title":"Overcoming Vision Language Model Challenges in Diagram Understanding: A Proof-of-Concept with XML-Driven Large Language Models Solutions","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO","json":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO.json","graph_json":"https://pith.science/api/pith-number/SOZFH4PV5W7UDMNW4C5ZB46QWO/graph.json","events_json":"https://pith.science/api/pith-number/SOZFH4PV5W7UDMNW4C5ZB46QWO/events.json","paper":"https://pith.science/paper/SOZFH4PV"},"agent_actions":{"view_html":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO","download_json":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO.json","view_paper":"https://pith.science/paper/SOZFH4PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08963&json=true","fetch_graph":"https://pith.science/api/pith-number/SOZFH4PV5W7UDMNW4C5ZB46QWO/graph.json","fetch_events":"https://pith.science/api/pith-number/SOZFH4PV5W7UDMNW4C5ZB46QWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO/action/storage_attestation","attest_author":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO/action/author_attestation","sign_citation":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO/action/citation_signature","submit_replication":"https://pith.science/pith/SOZFH4PV5W7UDMNW4C5ZB46QWO/action/replication_record"}},"created_at":"2026-07-05T09:06:50.274822+00:00","updated_at":"2026-07-05T09:06:50.274822+00:00"}