{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QJT7LPBN4KPPLZ7HFPYFOHVHJR","short_pith_number":"pith:QJT7LPBN","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"},"canonical_sha256":"8267f5bc2de29ef5e7e72bf0571ea74c56a7cd93685e81434696896714bc55af","source":{"kind":"arxiv","id":"1302.4951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4951","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4951v1","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4951","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"QJT7LPBN4KPP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QJT7LPBN4KPPLZ7H","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QJT7LPBN","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QJT7LPBN4KPPLZ7HFPYFOHVHJR","target":"record","payload":{"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"},"canonical_sha256":"8267f5bc2de29ef5e7e72bf0571ea74c56a7cd93685e81434696896714bc55af","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"},"source_kind":"arxiv","source_id":"1302.4951","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-18T03:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj+Iym72rHdbEQohtKNsXSupLAh6qqlW/4jNqzJ0p8Z+Ttcjd4q9tAX59QwtyCJK6zqQ9NWPSwl4T15ESh5LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:26:13.090970Z"},"content_sha256":"0b9283b07911da01e989bdf7428c682b4a477e5062a579b0d61bb9e7a2cc5529","schema_version":"1.0","event_id":"sha256:0b9283b07911da01e989bdf7428c682b4a477e5062a579b0d61bb9e7a2cc5529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QJT7LPBN4KPPLZ7HFPYFOHVHJR","target":"graph","payload":{"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"},"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-18T03:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZcz55HRrneBqcrCe5yZwr5DbMH5BTzeTpeKLPkKaLhExDY0iEQqvFCt4lHQCHDuwe4a9o4ibBAHRD/UTGM3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:26:13.091635Z"},"content_sha256":"c8d0703ec28d62497faf27295151dc7b0af679a13a795245b5e7ca594fe33dea","schema_version":"1.0","event_id":"sha256:c8d0703ec28d62497faf27295151dc7b0af679a13a795245b5e7ca594fe33dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/bundle.json","state_url":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/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-06-10T22:26:13Z","links":{"resolver":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR","bundle":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/bundle.json","state":"https://pith.science/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJT7LPBN4KPPLZ7HFPYFOHVHJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QJT7LPBN4KPPLZ7HFPYFOHVHJR","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":"87e597699f0ac0a789f1deae463177c55460b9a967402ffdc7b6bb6a8c54ea3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:52Z","title_canon_sha256":"725b844337d2514bd9d1e8421cbbb3c7bff8b208e01226cb1d928951a2f0c561"},"schema_version":"1.0","source":{"id":"1302.4951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4951","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4951v1","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4951","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"QJT7LPBN4KPP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QJT7LPBN4KPPLZ7H","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QJT7LPBN","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:c8d0703ec28d62497faf27295151dc7b0af679a13a795245b5e7ca594fe33dea","target":"graph","created_at":"2026-05-18T03:33:00Z","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":"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","authors_text":"Benjamin N. Grosof","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:52Z","title":"Transforming Prioritized Defaults and Specificity into Parallel Defaults"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4951","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:0b9283b07911da01e989bdf7428c682b4a477e5062a579b0d61bb9e7a2cc5529","target":"record","created_at":"2026-05-18T03:33:00Z","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":"87e597699f0ac0a789f1deae463177c55460b9a967402ffdc7b6bb6a8c54ea3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:52Z","title_canon_sha256":"725b844337d2514bd9d1e8421cbbb3c7bff8b208e01226cb1d928951a2f0c561"},"schema_version":"1.0","source":{"id":"1302.4951","kind":"arxiv","version":1}},"canonical_sha256":"8267f5bc2de29ef5e7e72bf0571ea74c56a7cd93685e81434696896714bc55af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8267f5bc2de29ef5e7e72bf0571ea74c56a7cd93685e81434696896714bc55af","first_computed_at":"2026-05-18T03:33:00.909471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:00.909471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kPGDJiGnPTt889efZiAV5asbkixGqhF6zdh8AN2X7XGcu8mWQuJk8QOK/EdtTHXBPJ59BZ+OrnO0kjU2DXZ6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:00.910244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b9283b07911da01e989bdf7428c682b4a477e5062a579b0d61bb9e7a2cc5529","sha256:c8d0703ec28d62497faf27295151dc7b0af679a13a795245b5e7ca594fe33dea"],"state_sha256":"84cebde50c79011d09cb835911e40ebe90161c4d0310ec5d0676f3bd217de7d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoKHdKiqJf2Rh1h40NeXV5ZwtXjL+wNNXOkVJyCNqVB2nCHrOsxgNJBV8Qfs7plcLt79icc0iFgLIkE+0xDKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:26:13.096877Z","bundle_sha256":"3f32ec39e933d1142737e454267c22d3a7b8b0730d00aaee651c48d0f451bf20"}}