{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HPME2B227XEJCIX7ZW62TM6ZZA","short_pith_number":"pith:HPME2B22","schema_version":"1.0","canonical_sha256":"3bd84d075afdc89122ffcdbda9b3d9c8000810259eb48076947366eafa4baaab","source":{"kind":"arxiv","id":"1907.01006","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of Preferred Extensions in Almost Oriented Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ray Li, Serge Gaspers","submitted_at":"2019-07-01T18:25:57Z","abstract_excerpt":"In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a directed graph. For directed graphs on $n$ vertices, all preferred extensions can be enumerated in $O^*(3^{n/3})$ time and there are directed graphs with $\\Omega(3^{n/3})$ preferred extensions. We give faster enumeration algorithms for directed graphs with at most $0.8004\\cdot n$ vertices occurring in $2$-cycles. In particular, for oriented graphs (digraphs with no 2-cycles) one of our algorithms runs in time $O(1.2"},"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":"1907.01006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-01T18:25:57Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"173ba17bf96b89efd1f448b89e219d3bdfd727f862da6016c428e8964c55b5a7","abstract_canon_sha256":"f19c60ae78e767460bfcb164eb628d55d9f9a215e0131babaf15a9f37f63652f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:41.474542Z","signature_b64":"j/3FEOQwd1w9oYnGFFqwPldBoo2+BgQfZsR7EjU0dVpUKJykCpBdtavLnDUHNdEXgdLAmlH4E4GR1Vnt5cZ1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bd84d075afdc89122ffcdbda9b3d9c8000810259eb48076947366eafa4baaab","last_reissued_at":"2026-05-17T23:41:41.474036Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:41.474036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of Preferred Extensions in Almost Oriented Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ray Li, Serge Gaspers","submitted_at":"2019-07-01T18:25:57Z","abstract_excerpt":"In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a directed graph. For directed graphs on $n$ vertices, all preferred extensions can be enumerated in $O^*(3^{n/3})$ time and there are directed graphs with $\\Omega(3^{n/3})$ preferred extensions. We give faster enumeration algorithms for directed graphs with at most $0.8004\\cdot n$ vertices occurring in $2$-cycles. In particular, for oriented graphs (digraphs with no 2-cycles) one of our algorithms runs in time $O(1.2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01006","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":"1907.01006","created_at":"2026-05-17T23:41:41.474117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01006v1","created_at":"2026-05-17T23:41:41.474117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01006","created_at":"2026-05-17T23:41:41.474117+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPME2B227XEJ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPME2B227XEJCIX7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPME2B22","created_at":"2026-05-18T12:33:18.533446+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/HPME2B227XEJCIX7ZW62TM6ZZA","json":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA.json","graph_json":"https://pith.science/api/pith-number/HPME2B227XEJCIX7ZW62TM6ZZA/graph.json","events_json":"https://pith.science/api/pith-number/HPME2B227XEJCIX7ZW62TM6ZZA/events.json","paper":"https://pith.science/paper/HPME2B22"},"agent_actions":{"view_html":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA","download_json":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA.json","view_paper":"https://pith.science/paper/HPME2B22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01006&json=true","fetch_graph":"https://pith.science/api/pith-number/HPME2B227XEJCIX7ZW62TM6ZZA/graph.json","fetch_events":"https://pith.science/api/pith-number/HPME2B227XEJCIX7ZW62TM6ZZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA/action/storage_attestation","attest_author":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA/action/author_attestation","sign_citation":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA/action/citation_signature","submit_replication":"https://pith.science/pith/HPME2B227XEJCIX7ZW62TM6ZZA/action/replication_record"}},"created_at":"2026-05-17T23:41:41.474117+00:00","updated_at":"2026-05-17T23:41:41.474117+00:00"}