{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QJT7LPBN4KPPLZ7HFPYFOHVHJR","short_pith_number":"pith:QJT7LPBN","schema_version":"1.0","canonical_sha256":"8267f5bc2de29ef5e7e72bf0571ea74c56a7cd93685e81434696896714bc55af","source":{"kind":"arxiv","id":"1302.4951","version":1},"attestation_state":"computed","paper":{"title":"Transforming Prioritized Defaults and Specificity into Parallel Defaults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin N. Grosof","submitted_at":"2013-02-20T15:20:52Z","abstract_excerpt":"We show how to transform any set of prioritized propositional defaults into an equivalent set of parallel (i.e., unprioritized) defaults, in circumscription.  We give an algorithm to implement the transform.  We show how to use the transform algorithm as a generator of a whole family of inferencing algorithms for circumscription.  The method is to employ the transform algorithm as a front end to any inferencing algorithm, e.g., one of the previously available, that handles the parallel (empty) case of prioritization.  Our algorithms provide not just coverage of a new expressive class, but also"},"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":"1302.4951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:52Z","cross_cats_sorted":[],"title_canon_sha256":"725b844337d2514bd9d1e8421cbbb3c7bff8b208e01226cb1d928951a2f0c561","abstract_canon_sha256":"87e597699f0ac0a789f1deae463177c55460b9a967402ffdc7b6bb6a8c54ea3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:00.910244Z","signature_b64":"kPGDJiGnPTt889efZiAV5asbkixGqhF6zdh8AN2X7XGcu8mWQuJk8QOK/EdtTHXBPJ59BZ+OrnO0kjU2DXZ6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8267f5bc2de29ef5e7e72bf0571ea74c56a7cd93685e81434696896714bc55af","last_reissued_at":"2026-05-18T03:33:00.909471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:00.909471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transforming Prioritized Defaults and Specificity into Parallel Defaults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin N. Grosof","submitted_at":"2013-02-20T15:20:52Z","abstract_excerpt":"We show how to transform any set of prioritized propositional defaults into an equivalent set of parallel (i.e., unprioritized) defaults, in circumscription.  We give an algorithm to implement the transform.  We show how to use the transform algorithm as a generator of a whole family of inferencing algorithms for circumscription.  The method is to employ the transform algorithm as a front end to any inferencing algorithm, e.g., one of the previously available, that handles the parallel (empty) case of prioritization.  Our algorithms provide not just coverage of a new expressive class, but also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4951","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":"1302.4951","created_at":"2026-05-18T03:33:00.909599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4951v1","created_at":"2026-05-18T03:33:00.909599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4951","created_at":"2026-05-18T03:33:00.909599+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJT7LPBN4KPP","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJT7LPBN4KPPLZ7H","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJT7LPBN","created_at":"2026-05-18T12:27:57.521954+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/QJT7LPBN4KPPLZ7HFPYFOHVHJR","json":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR.json","graph_json":"https://pith.science/api/pith-number/QJT7LPBN4KPPLZ7HFPYFOHVHJR/graph.json","events_json":"https://pith.science/api/pith-number/QJT7LPBN4KPPLZ7HFPYFOHVHJR/events.json","paper":"https://pith.science/paper/QJT7LPBN"},"agent_actions":{"view_html":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR","download_json":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR.json","view_paper":"https://pith.science/paper/QJT7LPBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4951&json=true","fetch_graph":"https://pith.science/api/pith-number/QJT7LPBN4KPPLZ7HFPYFOHVHJR/graph.json","fetch_events":"https://pith.science/api/pith-number/QJT7LPBN4KPPLZ7HFPYFOHVHJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/action/storage_attestation","attest_author":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/action/author_attestation","sign_citation":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/action/citation_signature","submit_replication":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/action/replication_record"}},"created_at":"2026-05-18T03:33:00.909599+00:00","updated_at":"2026-05-18T03:33:00.909599+00:00"}