{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XM5ZWVILJZGK3T6TINJ6NLOWPP","short_pith_number":"pith:XM5ZWVIL","schema_version":"1.0","canonical_sha256":"bb3b9b550b4e4cadcfd34353e6add67bd6f7f3fe58a3661f5d9a6d87289c3ade","source":{"kind":"arxiv","id":"1709.07255","version":2},"attestation_state":"computed","paper":{"title":"Assumption-Based Approaches to Reasoning with Priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Stra{\\ss}er, Jesse Heyninck, Pere Pardo","submitted_at":"2017-09-21T10:46:00Z","abstract_excerpt":"This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats i.e. attacks, preference-based defeats, and preference-based defeats extended with reverse defeat."},"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":"1709.07255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-21T10:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"d5dccd6b5872013a3ad2cf8b41f64884eca9b5c959aee9bb9a7c57b0b8982f2f","abstract_canon_sha256":"aa8e3dc1d1b84a6923f1be34abf2f7f37993b70cf00f98c2e8b56542404b2110"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:04.441665Z","signature_b64":"wg4es1mfA0UVrI5brX5Thd5MvQ1pCNbhydn/BTTSaMtXOYF6aDSOjhbPrGktbKrzsmT/hpcQeOEAlF/M3vgeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3b9b550b4e4cadcfd34353e6add67bd6f7f3fe58a3661f5d9a6d87289c3ade","last_reissued_at":"2026-05-18T00:34:04.440995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:04.440995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assumption-Based Approaches to Reasoning with Priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Stra{\\ss}er, Jesse Heyninck, Pere Pardo","submitted_at":"2017-09-21T10:46:00Z","abstract_excerpt":"This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats i.e. attacks, preference-based defeats, and preference-based defeats extended with reverse defeat."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07255","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":"1709.07255","created_at":"2026-05-18T00:34:04.441098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07255v2","created_at":"2026-05-18T00:34:04.441098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07255","created_at":"2026-05-18T00:34:04.441098+00:00"},{"alias_kind":"pith_short_12","alias_value":"XM5ZWVILJZGK","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XM5ZWVILJZGK3T6T","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XM5ZWVIL","created_at":"2026-05-18T12:31:56.362134+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/XM5ZWVILJZGK3T6TINJ6NLOWPP","json":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP.json","graph_json":"https://pith.science/api/pith-number/XM5ZWVILJZGK3T6TINJ6NLOWPP/graph.json","events_json":"https://pith.science/api/pith-number/XM5ZWVILJZGK3T6TINJ6NLOWPP/events.json","paper":"https://pith.science/paper/XM5ZWVIL"},"agent_actions":{"view_html":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP","download_json":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP.json","view_paper":"https://pith.science/paper/XM5ZWVIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07255&json=true","fetch_graph":"https://pith.science/api/pith-number/XM5ZWVILJZGK3T6TINJ6NLOWPP/graph.json","fetch_events":"https://pith.science/api/pith-number/XM5ZWVILJZGK3T6TINJ6NLOWPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP/action/storage_attestation","attest_author":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP/action/author_attestation","sign_citation":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP/action/citation_signature","submit_replication":"https://pith.science/pith/XM5ZWVILJZGK3T6TINJ6NLOWPP/action/replication_record"}},"created_at":"2026-05-18T00:34:04.441098+00:00","updated_at":"2026-05-18T00:34:04.441098+00:00"}