{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7MZI2V36ZHM6RYTRHQOASDRJXO","short_pith_number":"pith:7MZI2V36","schema_version":"1.0","canonical_sha256":"fb328d577ec9d9e8e2713c1c090e29bb8bf174b20a12a6b63000c3a6e28f0974","source":{"kind":"arxiv","id":"1411.2800","version":2},"attestation_state":"computed","paper":{"title":"Exploiting Parallelism for Hard Problems in Abstract Argumentation: Technical Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Federico Cerutti, Grigoris Antoniou, Ilias Tachmazidis, Massimiliano Giacomin, Mauro Vallati, Sotirios Batsakis","submitted_at":"2014-11-11T13:33:33Z","abstract_excerpt":"Abstract argumentation framework (\\AFname) is a unifying framework able to encompass a variety of nonmonotonic reasoning approaches, logic programming and computational argumentation. Yet, efficient approaches for most of the decision and enumeration problems associated to \\AFname s are missing, thus potentially limiting the efficacy of argumentation-based approaches in real domains. In this paper, we present an algorithm for enumerating the preferred extensions of abstract argumentation frameworks which exploits parallel computation. To this purpose, the SCC-recursive semantics definition sch"},"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":"1411.2800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-11T13:33:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"22c1ce62314f5fe7f2ae4e68c15d8513fb47dc0cb117c9b81b7c26456bb522e8","abstract_canon_sha256":"3c6f1bdb6935fd21b6fcd50da32343bb905bb99fa412ea5f526271da4c48564d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.504264Z","signature_b64":"5aaz0I38gZwSkgkjzPy1cCGSSQKNG5PuDpi3ubOyVj/Q2TSxa+bsaZUgEn5hNlHYVRRq7vnpVxu2jM67ZLoPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb328d577ec9d9e8e2713c1c090e29bb8bf174b20a12a6b63000c3a6e28f0974","last_reissued_at":"2026-05-18T02:34:51.503909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.503909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Parallelism for Hard Problems in Abstract Argumentation: Technical Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Federico Cerutti, Grigoris Antoniou, Ilias Tachmazidis, Massimiliano Giacomin, Mauro Vallati, Sotirios Batsakis","submitted_at":"2014-11-11T13:33:33Z","abstract_excerpt":"Abstract argumentation framework (\\AFname) is a unifying framework able to encompass a variety of nonmonotonic reasoning approaches, logic programming and computational argumentation. Yet, efficient approaches for most of the decision and enumeration problems associated to \\AFname s are missing, thus potentially limiting the efficacy of argumentation-based approaches in real domains. In this paper, we present an algorithm for enumerating the preferred extensions of abstract argumentation frameworks which exploits parallel computation. To this purpose, the SCC-recursive semantics definition sch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2800","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.2800","created_at":"2026-05-18T02:34:51.503963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2800v2","created_at":"2026-05-18T02:34:51.503963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2800","created_at":"2026-05-18T02:34:51.503963+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MZI2V36ZHM6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MZI2V36ZHM6RYTR","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MZI2V36","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO","json":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO.json","graph_json":"https://pith.science/api/pith-number/7MZI2V36ZHM6RYTRHQOASDRJXO/graph.json","events_json":"https://pith.science/api/pith-number/7MZI2V36ZHM6RYTRHQOASDRJXO/events.json","paper":"https://pith.science/paper/7MZI2V36"},"agent_actions":{"view_html":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO","download_json":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO.json","view_paper":"https://pith.science/paper/7MZI2V36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2800&json=true","fetch_graph":"https://pith.science/api/pith-number/7MZI2V36ZHM6RYTRHQOASDRJXO/graph.json","fetch_events":"https://pith.science/api/pith-number/7MZI2V36ZHM6RYTRHQOASDRJXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/action/storage_attestation","attest_author":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/action/author_attestation","sign_citation":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/action/citation_signature","submit_replication":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/action/replication_record"}},"created_at":"2026-05-18T02:34:51.503963+00:00","updated_at":"2026-05-18T02:34:51.503963+00:00"}