{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XNM7UWXWN3US37ZYUS5W6NMEGO","short_pith_number":"pith:XNM7UWXW","schema_version":"1.0","canonical_sha256":"bb59fa5af66ee92dff38a4bb6f35843399a50fb638a36b1a2bc36219a179f8fc","source":{"kind":"arxiv","id":"1203.0220","version":1},"attestation_state":"computed","paper":{"title":"The Equational Approach to CF2 Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Dov M. Gabbay","submitted_at":"2012-03-01T15:45:31Z","abstract_excerpt":"We introduce a family of new equational semantics for argumentation networks which can handle odd and even loops in a uniform manner. We offer one version of equational semantics which is equivalent to CF2 semantics, and a better version which gives the same results as traditional Dung semantics for even loops but can still handle odd loops."},"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":"1203.0220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-01T15:45:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"450de5c10ced24455d667b67552e3cfcb0318963d75fba14c700b2875437a779","abstract_canon_sha256":"e6f957c39b88f92a24d6fd8b389cfa6068e7ddd09e53a56a2a97101ee78c1ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:02.811209Z","signature_b64":"Ey7ozuZv+FXBY8gYIhbwOQ8jj3nPgoJGUsxrfoiV6YZZFuPGCijaawurqIocnzRMA3/XVj9iQ1C1u+BaWMS8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb59fa5af66ee92dff38a4bb6f35843399a50fb638a36b1a2bc36219a179f8fc","last_reissued_at":"2026-05-18T04:01:02.810489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:02.810489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Equational Approach to CF2 Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Dov M. Gabbay","submitted_at":"2012-03-01T15:45:31Z","abstract_excerpt":"We introduce a family of new equational semantics for argumentation networks which can handle odd and even loops in a uniform manner. We offer one version of equational semantics which is equivalent to CF2 semantics, and a better version which gives the same results as traditional Dung semantics for even loops but can still handle odd loops."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0220","kind":"arxiv","version":1},"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":"1203.0220","created_at":"2026-05-18T04:01:02.810607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0220v1","created_at":"2026-05-18T04:01:02.810607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0220","created_at":"2026-05-18T04:01:02.810607+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNM7UWXWN3US","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNM7UWXWN3US37ZY","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNM7UWXW","created_at":"2026-05-18T12:27:27.928770+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/XNM7UWXWN3US37ZYUS5W6NMEGO","json":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO.json","graph_json":"https://pith.science/api/pith-number/XNM7UWXWN3US37ZYUS5W6NMEGO/graph.json","events_json":"https://pith.science/api/pith-number/XNM7UWXWN3US37ZYUS5W6NMEGO/events.json","paper":"https://pith.science/paper/XNM7UWXW"},"agent_actions":{"view_html":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO","download_json":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO.json","view_paper":"https://pith.science/paper/XNM7UWXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0220&json=true","fetch_graph":"https://pith.science/api/pith-number/XNM7UWXWN3US37ZYUS5W6NMEGO/graph.json","fetch_events":"https://pith.science/api/pith-number/XNM7UWXWN3US37ZYUS5W6NMEGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO/action/storage_attestation","attest_author":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO/action/author_attestation","sign_citation":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO/action/citation_signature","submit_replication":"https://pith.science/pith/XNM7UWXWN3US37ZYUS5W6NMEGO/action/replication_record"}},"created_at":"2026-05-18T04:01:02.810607+00:00","updated_at":"2026-05-18T04:01:02.810607+00:00"}