{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FYELMEEQT3SK3PC6LBL2DCPDYC","short_pith_number":"pith:FYELMEEQ","canonical_record":{"source":{"id":"1810.04892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-11T08:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"3f67ba5b626b7e391f9e6941cb5a1dc66f69817b044f6b0ece103f3408c7b810","abstract_canon_sha256":"b49feacb0210648ae94d919d701060234ac0b0aac4db59978dde0887151346e8"},"schema_version":"1.0"},"canonical_sha256":"2e08b610909ee4adbc5e5857a189e3c0aa84cfbbc7766868e2cd4e535daf90ec","source":{"kind":"arxiv","id":"1810.04892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04892","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04892v1","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04892","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"FYELMEEQT3SK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FYELMEEQT3SK3PC6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FYELMEEQ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FYELMEEQT3SK3PC6LBL2DCPDYC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-11T08:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"3f67ba5b626b7e391f9e6941cb5a1dc66f69817b044f6b0ece103f3408c7b810","abstract_canon_sha256":"b49feacb0210648ae94d919d701060234ac0b0aac4db59978dde0887151346e8"},"schema_version":"1.0"},"canonical_sha256":"2e08b610909ee4adbc5e5857a189e3c0aa84cfbbc7766868e2cd4e535daf90ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:35.554162Z","signature_b64":"QYKJRvS5OIgZ0iuq0rHTsRPDwL+S7HhSdZzHtNlqu7OpYYelbdW7N3nPiDXCrg3nQ7faInElcOYbvWvhpKozAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e08b610909ee4adbc5e5857a189e3c0aa84cfbbc7766868e2cd4e535daf90ec","last_reissued_at":"2026-05-18T00:03:35.553621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:35.553621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04892","source_version":1,"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-18T00:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SybMluRP4xwb1sh+CXfocnKqbNIAq1zIgKtwGs+x3wzu7q18AFCk+rLPl/dZgY24cJ03kLeiEzLzMZ/S/pmNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:55.766145Z"},"content_sha256":"942b7e4f5ae2efa133320731aff9570ab736ec1453f3854f18d557b571e74857","schema_version":"1.0","event_id":"sha256:942b7e4f5ae2efa133320731aff9570ab736ec1453f3854f18d557b571e74857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FYELMEEQT3SK3PC6LBL2DCPDYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automata for Infinite Argumentation Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Federico Cerutti, Massimiliano Giacomin, Paul E. Dunne, Pietro Baroni","submitted_at":"2018-10-11T08:26:59Z","abstract_excerpt":"The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this limitation, in this paper we propose a novel approach for describing infinite afs using tools from formal language theory. In particular, the possibly infinite set of arguments is specified through the language recognized by a deterministic finite automaton while a suitable formalism, called attack expression, is introduced to describe the relation of attack b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04892","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"},"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-18T00:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOgDcr2zfQrBdzTvJfltuSNjUHOtlgLzMGA+za4tgWTWpSd+kiUNeNeGEyMGrO1QdknUQBDxmuzv9GxBR+iqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:55.766833Z"},"content_sha256":"9de36ffe9d7cb5b73638b778856921ff01f6ebc689a0ab7e40962e45cdf7bb71","schema_version":"1.0","event_id":"sha256:9de36ffe9d7cb5b73638b778856921ff01f6ebc689a0ab7e40962e45cdf7bb71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYELMEEQT3SK3PC6LBL2DCPDYC/bundle.json","state_url":"https://pith.science/pith/FYELMEEQT3SK3PC6LBL2DCPDYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYELMEEQT3SK3PC6LBL2DCPDYC/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-31T21:54:55Z","links":{"resolver":"https://pith.science/pith/FYELMEEQT3SK3PC6LBL2DCPDYC","bundle":"https://pith.science/pith/FYELMEEQT3SK3PC6LBL2DCPDYC/bundle.json","state":"https://pith.science/pith/FYELMEEQT3SK3PC6LBL2DCPDYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYELMEEQT3SK3PC6LBL2DCPDYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FYELMEEQT3SK3PC6LBL2DCPDYC","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":"b49feacb0210648ae94d919d701060234ac0b0aac4db59978dde0887151346e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-11T08:26:59Z","title_canon_sha256":"3f67ba5b626b7e391f9e6941cb5a1dc66f69817b044f6b0ece103f3408c7b810"},"schema_version":"1.0","source":{"id":"1810.04892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04892","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04892v1","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04892","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"FYELMEEQT3SK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FYELMEEQT3SK3PC6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FYELMEEQ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:9de36ffe9d7cb5b73638b778856921ff01f6ebc689a0ab7e40962e45cdf7bb71","target":"graph","created_at":"2026-05-18T00:03:35Z","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":"The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this limitation, in this paper we propose a novel approach for describing infinite afs using tools from formal language theory. In particular, the possibly infinite set of arguments is specified through the language recognized by a deterministic finite automaton while a suitable formalism, called attack expression, is introduced to describe the relation of attack b","authors_text":"Federico Cerutti, Massimiliano Giacomin, Paul E. Dunne, Pietro Baroni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-11T08:26:59Z","title":"Automata for Infinite Argumentation Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04892","kind":"arxiv","version":1},"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:942b7e4f5ae2efa133320731aff9570ab736ec1453f3854f18d557b571e74857","target":"record","created_at":"2026-05-18T00:03:35Z","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":"b49feacb0210648ae94d919d701060234ac0b0aac4db59978dde0887151346e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-11T08:26:59Z","title_canon_sha256":"3f67ba5b626b7e391f9e6941cb5a1dc66f69817b044f6b0ece103f3408c7b810"},"schema_version":"1.0","source":{"id":"1810.04892","kind":"arxiv","version":1}},"canonical_sha256":"2e08b610909ee4adbc5e5857a189e3c0aa84cfbbc7766868e2cd4e535daf90ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e08b610909ee4adbc5e5857a189e3c0aa84cfbbc7766868e2cd4e535daf90ec","first_computed_at":"2026-05-18T00:03:35.553621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:35.553621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYKJRvS5OIgZ0iuq0rHTsRPDwL+S7HhSdZzHtNlqu7OpYYelbdW7N3nPiDXCrg3nQ7faInElcOYbvWvhpKozAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:35.554162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:942b7e4f5ae2efa133320731aff9570ab736ec1453f3854f18d557b571e74857","sha256:9de36ffe9d7cb5b73638b778856921ff01f6ebc689a0ab7e40962e45cdf7bb71"],"state_sha256":"7dfa59939839683a956b703dc1849a8fa2d19ad434edb7de4598133f66aae6f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Qq9aMLPd+N7v0itDGKuqgGNRqpsT7HD54UDZgbnOvW4zfieWNKMjIxlbZr+YaECBr/9wU2X0/B/jvj+i+1cCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:54:55.771042Z","bundle_sha256":"7c4c803dab0773e2e5aa500142cb2e2b9b8ea3298781aa8141ccc12ebcebf8c9"}}