{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HVVH774OZ7CUD6VRNGU4ZR2KP2","short_pith_number":"pith:HVVH774O","schema_version":"1.0","canonical_sha256":"3d6a7fff8ecfc541fab169a9ccc74a7e8512d3d759f52c259155f145c7a01200","source":{"kind":"arxiv","id":"1902.05479","version":1},"attestation_state":"computed","paper":{"title":"Which is the least complex explanation? Abduction and complexity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Fernando Soler-Toscano","submitted_at":"2019-02-14T16:22:16Z","abstract_excerpt":"It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of abductive hypotheses. Are there criteria that can help us to select the simplest explanation in a broad spectrum of abductive problems? To give an (affirmative) answer to this question we will move to a field in theoretical computer science: Algorithmic Information Theory (AIT). The algorithmic complexity measure K(s) can be used to determine whic"},"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":"1902.05479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.LO","submitted_at":"2019-02-14T16:22:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6f687fa7519e5e178b836f3c458d884a385b9a5a9bafd7b6c4f05b141d714b97","abstract_canon_sha256":"179138a3fc85cacd5e9966e678bfbac812dd84e7003d07e8d2aa03f9bcea6f92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.595464Z","signature_b64":"qGZR7axdI7CwUC0EtO7hxUsNUNfj4ijhpwXZ3CGsGFcvZB1gFn2PmJcgT86h5lyiba28F/+npbBC0+8lZowOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d6a7fff8ecfc541fab169a9ccc74a7e8512d3d759f52c259155f145c7a01200","last_reissued_at":"2026-05-17T23:53:58.594608Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.594608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which is the least complex explanation? Abduction and complexity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Fernando Soler-Toscano","submitted_at":"2019-02-14T16:22:16Z","abstract_excerpt":"It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of abductive hypotheses. Are there criteria that can help us to select the simplest explanation in a broad spectrum of abductive problems? To give an (affirmative) answer to this question we will move to a field in theoretical computer science: Algorithmic Information Theory (AIT). The algorithmic complexity measure K(s) can be used to determine whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05479","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":"1902.05479","created_at":"2026-05-17T23:53:58.594747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05479v1","created_at":"2026-05-17T23:53:58.594747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05479","created_at":"2026-05-17T23:53:58.594747+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVVH774OZ7CU","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVVH774OZ7CUD6VR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVVH774O","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/HVVH774OZ7CUD6VRNGU4ZR2KP2","json":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2.json","graph_json":"https://pith.science/api/pith-number/HVVH774OZ7CUD6VRNGU4ZR2KP2/graph.json","events_json":"https://pith.science/api/pith-number/HVVH774OZ7CUD6VRNGU4ZR2KP2/events.json","paper":"https://pith.science/paper/HVVH774O"},"agent_actions":{"view_html":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2","download_json":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2.json","view_paper":"https://pith.science/paper/HVVH774O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05479&json=true","fetch_graph":"https://pith.science/api/pith-number/HVVH774OZ7CUD6VRNGU4ZR2KP2/graph.json","fetch_events":"https://pith.science/api/pith-number/HVVH774OZ7CUD6VRNGU4ZR2KP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2/action/storage_attestation","attest_author":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2/action/author_attestation","sign_citation":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2/action/citation_signature","submit_replication":"https://pith.science/pith/HVVH774OZ7CUD6VRNGU4ZR2KP2/action/replication_record"}},"created_at":"2026-05-17T23:53:58.594747+00:00","updated_at":"2026-05-17T23:53:58.594747+00:00"}