{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2ZNDINZLG2ZAFGCIRPLF5TNYG2","short_pith_number":"pith:2ZNDINZL","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"},"canonical_sha256":"d65a34372b36b20298488bd65ecdb8369b1a463d3054919197dcd2cc4f8e6774","source":{"kind":"arxiv","id":"1212.2857","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2857","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2857v2","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2857","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"2ZNDINZLG2ZA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2ZNDINZLG2ZAFGCI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2ZNDINZL","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2ZNDINZLG2ZAFGCIRPLF5TNYG2","target":"record","payload":{"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"},"canonical_sha256":"d65a34372b36b20298488bd65ecdb8369b1a463d3054919197dcd2cc4f8e6774","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"},"source_kind":"arxiv","source_id":"1212.2857","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:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oGiKTcTZRhXk9UG/Twvk02BrUeBBxtUidHMi4D8V5krF2OBjeIVfuGCc4dpoy+w74WZd6jjiHU1Aa8AgCGeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:25:52.706429Z"},"content_sha256":"dc12629f4f9a1b86ea0ff57d5e0f1f572160cb12523f8ba768f55c755e6aa10f","schema_version":"1.0","event_id":"sha256:dc12629f4f9a1b86ea0ff57d5e0f1f572160cb12523f8ba768f55c755e6aa10f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2ZNDINZLG2ZAFGCIRPLF5TNYG2","target":"graph","payload":{"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"},"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:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoUhNh7VBUM5AZZtmUj7x+vOyjY7gtgPudf6J6Fy4fu+ScNg3ZYxLBL5Rd5w9q6bqnpP2fUsbGJhT+9qxjHSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:25:52.707034Z"},"content_sha256":"80b14d41eef5b7b633049704f3dd5460f44bea88ea07f314185b2cec8b347867","schema_version":"1.0","event_id":"sha256:80b14d41eef5b7b633049704f3dd5460f44bea88ea07f314185b2cec8b347867"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/bundle.json","state_url":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/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-23T19:25:52Z","links":{"resolver":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2","bundle":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/bundle.json","state":"https://pith.science/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZNDINZLG2ZAFGCIRPLF5TNYG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2ZNDINZLG2ZAFGCIRPLF5TNYG2","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":"1bb25f9fc98169ce4b1f547054a07ccb235e7e25100a3be8c8e3dcf28ee403fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T16:06:28Z","title_canon_sha256":"050b44b32eec95f884ff4f34d641c449efa5730f93dbaaba0302e1265e354db9"},"schema_version":"1.0","source":{"id":"1212.2857","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2857","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2857v2","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2857","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"2ZNDINZLG2ZA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2ZNDINZLG2ZAFGCI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2ZNDINZL","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:80b14d41eef5b7b633049704f3dd5460f44bea88ea07f314185b2cec8b347867","target":"graph","created_at":"2026-05-18T03:36:17Z","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":"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","authors_text":"Francesco Santini, Stefano Bistarelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T16:06:28Z","title":"ConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2857","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:dc12629f4f9a1b86ea0ff57d5e0f1f572160cb12523f8ba768f55c755e6aa10f","target":"record","created_at":"2026-05-18T03:36:17Z","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":"1bb25f9fc98169ce4b1f547054a07ccb235e7e25100a3be8c8e3dcf28ee403fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T16:06:28Z","title_canon_sha256":"050b44b32eec95f884ff4f34d641c449efa5730f93dbaaba0302e1265e354db9"},"schema_version":"1.0","source":{"id":"1212.2857","kind":"arxiv","version":2}},"canonical_sha256":"d65a34372b36b20298488bd65ecdb8369b1a463d3054919197dcd2cc4f8e6774","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d65a34372b36b20298488bd65ecdb8369b1a463d3054919197dcd2cc4f8e6774","first_computed_at":"2026-05-18T03:36:17.736716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:17.736716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XGplL+t8wxR9lb/51n3hVipg+d2eZ5DsNXHcESGwaII9UTwy6+ubpgKukp4yzbO+SD2c242kFn6Nfd3AL4qgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:17.737383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2857","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc12629f4f9a1b86ea0ff57d5e0f1f572160cb12523f8ba768f55c755e6aa10f","sha256:80b14d41eef5b7b633049704f3dd5460f44bea88ea07f314185b2cec8b347867"],"state_sha256":"f946b122ea61bc77c3e4567518a753396b9b2dec657bb74128026594d03b2d80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0wu+vK3nPRKy3lZ9Rwpo5A1dgjATfwk2A/m7sF/Alq7OgTf5ckbkIUK8zXU4nCC29teg4FFMCf0OH3gYWW4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T19:25:52.710435Z","bundle_sha256":"f208cf524738b48f507c729724ba6e1e7d0d052c0f62e873fccd3f0364c8c6da"}}