{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7MZI2V36ZHM6RYTRHQOASDRJXO","short_pith_number":"pith:7MZI2V36","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"},"canonical_sha256":"fb328d577ec9d9e8e2713c1c090e29bb8bf174b20a12a6b63000c3a6e28f0974","source":{"kind":"arxiv","id":"1411.2800","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2800","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2800v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2800","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"7MZI2V36ZHM6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7MZI2V36ZHM6RYTR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7MZI2V36","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7MZI2V36ZHM6RYTRHQOASDRJXO","target":"record","payload":{"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"},"canonical_sha256":"fb328d577ec9d9e8e2713c1c090e29bb8bf174b20a12a6b63000c3a6e28f0974","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"},"source_kind":"arxiv","source_id":"1411.2800","source_version":2,"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:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5lIWwUYaA4g+K3ouvuXe1l/2N3bNYdQePrUNXmYauDkGiTvR/X7P+LVWCaWHhiAauV7i1MMEICmVkOEC74ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:48:43.021631Z"},"content_sha256":"e78756591e6cf96c2a1b88e4854216e971bedc3deec9ad96cec6bda32defce89","schema_version":"1.0","event_id":"sha256:e78756591e6cf96c2a1b88e4854216e971bedc3deec9ad96cec6bda32defce89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7MZI2V36ZHM6RYTRHQOASDRJXO","target":"graph","payload":{"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"},"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:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JF3E1TVcGIw+OU2Hye2aNd3ZPRq7JHnaiLq9iOTyoKRrtyJrb8DlehorTthJpomXhlA41vjV+t1ypN6TR2n9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:48:43.022374Z"},"content_sha256":"0d4bd5abfea2b214d48a8d35973aa2fc5aad5c6c7a9eccdc68288662296aeca9","schema_version":"1.0","event_id":"sha256:0d4bd5abfea2b214d48a8d35973aa2fc5aad5c6c7a9eccdc68288662296aeca9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/bundle.json","state_url":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/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-05-31T19:48:43Z","links":{"resolver":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO","bundle":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/bundle.json","state":"https://pith.science/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MZI2V36ZHM6RYTRHQOASDRJXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7MZI2V36ZHM6RYTRHQOASDRJXO","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":"3c6f1bdb6935fd21b6fcd50da32343bb905bb99fa412ea5f526271da4c48564d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-11T13:33:33Z","title_canon_sha256":"22c1ce62314f5fe7f2ae4e68c15d8513fb47dc0cb117c9b81b7c26456bb522e8"},"schema_version":"1.0","source":{"id":"1411.2800","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2800","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2800v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2800","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"7MZI2V36ZHM6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7MZI2V36ZHM6RYTR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7MZI2V36","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:0d4bd5abfea2b214d48a8d35973aa2fc5aad5c6c7a9eccdc68288662296aeca9","target":"graph","created_at":"2026-05-18T02:34:51Z","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":"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","authors_text":"Federico Cerutti, Grigoris Antoniou, Ilias Tachmazidis, Massimiliano Giacomin, Mauro Vallati, Sotirios Batsakis","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-11T13:33:33Z","title":"Exploiting Parallelism for Hard Problems in Abstract Argumentation: Technical Report"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2800","kind":"arxiv","version":2},"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:e78756591e6cf96c2a1b88e4854216e971bedc3deec9ad96cec6bda32defce89","target":"record","created_at":"2026-05-18T02:34:51Z","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":"3c6f1bdb6935fd21b6fcd50da32343bb905bb99fa412ea5f526271da4c48564d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-11T13:33:33Z","title_canon_sha256":"22c1ce62314f5fe7f2ae4e68c15d8513fb47dc0cb117c9b81b7c26456bb522e8"},"schema_version":"1.0","source":{"id":"1411.2800","kind":"arxiv","version":2}},"canonical_sha256":"fb328d577ec9d9e8e2713c1c090e29bb8bf174b20a12a6b63000c3a6e28f0974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb328d577ec9d9e8e2713c1c090e29bb8bf174b20a12a6b63000c3a6e28f0974","first_computed_at":"2026-05-18T02:34:51.503909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:51.503909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5aaz0I38gZwSkgkjzPy1cCGSSQKNG5PuDpi3ubOyVj/Q2TSxa+bsaZUgEn5hNlHYVRRq7vnpVxu2jM67ZLoPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:51.504264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2800","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e78756591e6cf96c2a1b88e4854216e971bedc3deec9ad96cec6bda32defce89","sha256:0d4bd5abfea2b214d48a8d35973aa2fc5aad5c6c7a9eccdc68288662296aeca9"],"state_sha256":"9f570db9beeec8b57b5eadf8c00c46b7336af9dd2ceb1f1a413dc3cc3d6efb72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J73fhF+03GzaVr0WlQfI1HTxIhFbvbnFW0WvWSANlFiEUfEky0DfcoVu9Gz1r/7WkBkc2qgECIZ/ajKThIQCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:48:43.027195Z","bundle_sha256":"5920d0cbbc3f1cf3923da2407fbc288fd5380628e3175254b0a1a7e70b0aefb0"}}