{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M2F6GIWM5S2BHHP3SOPLYZTXVV","short_pith_number":"pith:M2F6GIWM","schema_version":"1.0","canonical_sha256":"668be322ccecb4139dfb939ebc6677ad7eaeb0d64a93473d0d976111a86e0bd1","source":{"kind":"arxiv","id":"1810.00798","version":1},"attestation_state":"computed","paper":{"title":"Doric: Foundations for Statistical Fault Localisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"David Landsberg, Earl Barr","submitted_at":"2018-10-01T16:28:43Z","abstract_excerpt":"To fix a software bug, you must first find it. As software grows in size and complexity, finding bugs is becoming harder. To solve this problem, measures have been developed to rank lines of code according to their \"suspiciousness\" wrt being faulty. Engineers can then inspect the code in descending order of suspiciousness until a fault is found. Despite advances, ideal measures --- ones which are at once lightweight, effective, and intuitive --- have not yet been found. We present Doric, a new formal foundation for statistical fault localisation based on classical probability theory. To demons"},"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":"1810.00798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-10-01T16:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"8ad4e8eb80c831fa597ee023e2283dc71d93238c70ffd5be459b3d77e5c865db","abstract_canon_sha256":"d6c99e8762ec30fca4e7de58ef3b5fa456def280c0c6af17f8563ac36e20370b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:24.804252Z","signature_b64":"r2KlmtqxCUto3S1a4DoUeiEByTWw06qxKU3RI6DsmZ4N8YtC2A7+upKdtUny3FIc+6NAAuu+MAJR0H9247AACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668be322ccecb4139dfb939ebc6677ad7eaeb0d64a93473d0d976111a86e0bd1","last_reissued_at":"2026-05-18T00:04:24.803736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:24.803736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doric: Foundations for Statistical Fault Localisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"David Landsberg, Earl Barr","submitted_at":"2018-10-01T16:28:43Z","abstract_excerpt":"To fix a software bug, you must first find it. As software grows in size and complexity, finding bugs is becoming harder. To solve this problem, measures have been developed to rank lines of code according to their \"suspiciousness\" wrt being faulty. Engineers can then inspect the code in descending order of suspiciousness until a fault is found. Despite advances, ideal measures --- ones which are at once lightweight, effective, and intuitive --- have not yet been found. We present Doric, a new formal foundation for statistical fault localisation based on classical probability theory. To demons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00798","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":"1810.00798","created_at":"2026-05-18T00:04:24.803812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00798v1","created_at":"2026-05-18T00:04:24.803812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00798","created_at":"2026-05-18T00:04:24.803812+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2F6GIWM5S2B","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2F6GIWM5S2BHHP3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2F6GIWM","created_at":"2026-05-18T12:32:37.024351+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/M2F6GIWM5S2BHHP3SOPLYZTXVV","json":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV.json","graph_json":"https://pith.science/api/pith-number/M2F6GIWM5S2BHHP3SOPLYZTXVV/graph.json","events_json":"https://pith.science/api/pith-number/M2F6GIWM5S2BHHP3SOPLYZTXVV/events.json","paper":"https://pith.science/paper/M2F6GIWM"},"agent_actions":{"view_html":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV","download_json":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV.json","view_paper":"https://pith.science/paper/M2F6GIWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00798&json=true","fetch_graph":"https://pith.science/api/pith-number/M2F6GIWM5S2BHHP3SOPLYZTXVV/graph.json","fetch_events":"https://pith.science/api/pith-number/M2F6GIWM5S2BHHP3SOPLYZTXVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV/action/storage_attestation","attest_author":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV/action/author_attestation","sign_citation":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV/action/citation_signature","submit_replication":"https://pith.science/pith/M2F6GIWM5S2BHHP3SOPLYZTXVV/action/replication_record"}},"created_at":"2026-05-18T00:04:24.803812+00:00","updated_at":"2026-05-18T00:04:24.803812+00:00"}