{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2ZNDINZLG2ZAFGCIRPLF5TNYG2","short_pith_number":"pith:2ZNDINZL","schema_version":"1.0","canonical_sha256":"d65a34372b36b20298488bd65ecdb8369b1a463d3054919197dcd2cc4f8e6774","source":{"kind":"arxiv","id":"1212.2857","version":2},"attestation_state":"computed","paper":{"title":"ConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francesco Santini, Stefano Bistarelli","submitted_at":"2012-12-12T16:06:28Z","abstract_excerpt":"ConArg is a Constraint Programming-based tool that can be used to model and solve different problems related to Abstract Argumentation Frameworks (AFs). To implement this tool we have used JaCoP, a Java library that provides the user with a Finite Domain Constraint Programming paradigm. ConArg is able to randomly generate networks with small-world properties in order to find conflict-free, admissible, complete, stable grounded, preferred, semi-stable, stage and ideal extensions on such interaction graphs. We present the main features of ConArg and we report the performance in time, showing als"},"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":"1212.2857","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T16:06:28Z","cross_cats_sorted":[],"title_canon_sha256":"050b44b32eec95f884ff4f34d641c449efa5730f93dbaaba0302e1265e354db9","abstract_canon_sha256":"1bb25f9fc98169ce4b1f547054a07ccb235e7e25100a3be8c8e3dcf28ee403fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:17.737383Z","signature_b64":"XGplL+t8wxR9lb/51n3hVipg+d2eZ5DsNXHcESGwaII9UTwy6+ubpgKukp4yzbO+SD2c242kFn6Nfd3AL4qgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d65a34372b36b20298488bd65ecdb8369b1a463d3054919197dcd2cc4f8e6774","last_reissued_at":"2026-05-18T03:36:17.736716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:17.736716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francesco Santini, Stefano Bistarelli","submitted_at":"2012-12-12T16:06:28Z","abstract_excerpt":"ConArg is a Constraint Programming-based tool that can be used to model and solve different problems related to Abstract Argumentation Frameworks (AFs). To implement this tool we have used JaCoP, a Java library that provides the user with a Finite Domain Constraint Programming paradigm. ConArg is able to randomly generate networks with small-world properties in order to find conflict-free, admissible, complete, stable grounded, preferred, semi-stable, stage and ideal extensions on such interaction graphs. We present the main features of ConArg and we report the performance in time, showing als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2857","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":"1212.2857","created_at":"2026-05-18T03:36:17.736818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2857v2","created_at":"2026-05-18T03:36:17.736818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2857","created_at":"2026-05-18T03:36:17.736818+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZNDINZLG2ZA","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZNDINZLG2ZAFGCI","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZNDINZL","created_at":"2026-05-18T12:26:50.516681+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/2ZNDINZLG2ZAFGCIRPLF5TNYG2","json":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2.json","graph_json":"https://pith.science/api/pith-number/2ZNDINZLG2ZAFGCIRPLF5TNYG2/graph.json","events_json":"https://pith.science/api/pith-number/2ZNDINZLG2ZAFGCIRPLF5TNYG2/events.json","paper":"https://pith.science/paper/2ZNDINZL"},"agent_actions":{"view_html":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2","download_json":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2.json","view_paper":"https://pith.science/paper/2ZNDINZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2857&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZNDINZLG2ZAFGCIRPLF5TNYG2/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZNDINZLG2ZAFGCIRPLF5TNYG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/action/storage_attestation","attest_author":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/action/author_attestation","sign_citation":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/action/citation_signature","submit_replication":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/action/replication_record"}},"created_at":"2026-05-18T03:36:17.736818+00:00","updated_at":"2026-05-18T03:36:17.736818+00:00"}