{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4PM5NLGCPGA75VJ5AAKHQFWFG7","short_pith_number":"pith:4PM5NLGC","canonical_record":{"source":{"id":"1310.4986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-18T12:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"a9137035156a1b9e4f3a181180fcb319c460e628e1c4241f85f1e6e494819b78","abstract_canon_sha256":"9087a33f2db4ddd1d15d098015d44cc590e28e54a5ec0cfec9160d50ac422e8d"},"schema_version":"1.0"},"canonical_sha256":"e3d9d6acc27981fed53d00147816c537cd3e32bb1ba7f7528abe683449367b0a","source":{"kind":"arxiv","id":"1310.4986","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4986","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4986v2","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4986","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"4PM5NLGCPGA7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4PM5NLGCPGA75VJ5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4PM5NLGC","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4PM5NLGCPGA75VJ5AAKHQFWFG7","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-18T12:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"a9137035156a1b9e4f3a181180fcb319c460e628e1c4241f85f1e6e494819b78","abstract_canon_sha256":"9087a33f2db4ddd1d15d098015d44cc590e28e54a5ec0cfec9160d50ac422e8d"},"schema_version":"1.0"},"canonical_sha256":"e3d9d6acc27981fed53d00147816c537cd3e32bb1ba7f7528abe683449367b0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:21.673173Z","signature_b64":"mLmupZ0kDIynDOySfb3QEE35R7/0BH1kpxBKQR/zcdSd+BPQEBcUPhHJO6FFniyyksR75tp7V4+bd+bd2ex4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d9d6acc27981fed53d00147816c537cd3e32bb1ba7f7528abe683449367b0a","last_reissued_at":"2026-05-18T03:09:21.672622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:21.672622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4986","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-18T03:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMi4HDIln9lpuROLwSpcT2fYqf41cIwt+OHYwkk2YfyBu8CxzYE+FBrvHCQg++KmaNoYKVcinO3o3BqsMcd2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:53:40.654876Z"},"content_sha256":"5d9dfaf8330251d496dd39a7a3f06c229ac54349a7a3e2ffc0bfb469c2b20ec8","schema_version":"1.0","event_id":"sha256:5d9dfaf8330251d496dd39a7a3f06c229ac54349a7a3e2ffc0bfb469c2b20ec8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4PM5NLGCPGA75VJ5AAKHQFWFG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Paul E. Dunne","submitted_at":"2013-10-18T12:14:31Z","abstract_excerpt":"This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions. The proposed approach has been tested using two distinct SAT solvers and compared with three state-of-the-art systems for preferred extension computation. It turns out that the proposed approach delivers significantly better "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4986","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-18T03:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwSYvnmTBo7AlGDKNGjLKAoi40tCIkJqpgEJvNwK+SuNdqRykUGbXZEewf+RmMuK3P79DT8ipJIuZRYF3U5TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:53:40.655225Z"},"content_sha256":"9e2777537e149090f62cbbe37175c04b473fcdecb511b0cd57525cba1713ae17","schema_version":"1.0","event_id":"sha256:9e2777537e149090f62cbbe37175c04b473fcdecb511b0cd57525cba1713ae17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7/bundle.json","state_url":"https://pith.science/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7/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-05T02:53:40Z","links":{"resolver":"https://pith.science/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7","bundle":"https://pith.science/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7/bundle.json","state":"https://pith.science/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PM5NLGCPGA75VJ5AAKHQFWFG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4PM5NLGCPGA75VJ5AAKHQFWFG7","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":"9087a33f2db4ddd1d15d098015d44cc590e28e54a5ec0cfec9160d50ac422e8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-18T12:14:31Z","title_canon_sha256":"a9137035156a1b9e4f3a181180fcb319c460e628e1c4241f85f1e6e494819b78"},"schema_version":"1.0","source":{"id":"1310.4986","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4986","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4986v2","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4986","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"4PM5NLGCPGA7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4PM5NLGCPGA75VJ5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4PM5NLGC","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:9e2777537e149090f62cbbe37175c04b473fcdecb511b0cd57525cba1713ae17","target":"graph","created_at":"2026-05-18T03:09:21Z","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":"This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions. The proposed approach has been tested using two distinct SAT solvers and compared with three state-of-the-art systems for preferred extension computation. It turns out that the proposed approach delivers significantly better ","authors_text":"Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Paul E. Dunne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-18T12:14:31Z","title":"Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4986","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:5d9dfaf8330251d496dd39a7a3f06c229ac54349a7a3e2ffc0bfb469c2b20ec8","target":"record","created_at":"2026-05-18T03:09:21Z","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":"9087a33f2db4ddd1d15d098015d44cc590e28e54a5ec0cfec9160d50ac422e8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-18T12:14:31Z","title_canon_sha256":"a9137035156a1b9e4f3a181180fcb319c460e628e1c4241f85f1e6e494819b78"},"schema_version":"1.0","source":{"id":"1310.4986","kind":"arxiv","version":2}},"canonical_sha256":"e3d9d6acc27981fed53d00147816c537cd3e32bb1ba7f7528abe683449367b0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3d9d6acc27981fed53d00147816c537cd3e32bb1ba7f7528abe683449367b0a","first_computed_at":"2026-05-18T03:09:21.672622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:21.672622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLmupZ0kDIynDOySfb3QEE35R7/0BH1kpxBKQR/zcdSd+BPQEBcUPhHJO6FFniyyksR75tp7V4+bd+bd2ex4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:21.673173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4986","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d9dfaf8330251d496dd39a7a3f06c229ac54349a7a3e2ffc0bfb469c2b20ec8","sha256:9e2777537e149090f62cbbe37175c04b473fcdecb511b0cd57525cba1713ae17"],"state_sha256":"882d98c52093e14cad26d670dcf1a6141dad9a039626a8f2acbeb21964bca704"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsnLQtPf2oKKThvEMQrjU44c2PwMd7d4CdtXFxyqCf+crk2u+jDQCcfne66R9lhCaUh3HMgSV3IpK7xgVGi3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:53:40.657307Z","bundle_sha256":"dbc9a4f6091a085da4298666f555ecb93042f7ffe6fbcf591bea0b9fa3c1eb2f"}}