{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3AOKBXGKNIFKYWG2WH7CXFPQQC","short_pith_number":"pith:3AOKBXGK","schema_version":"1.0","canonical_sha256":"d81ca0dcca6a0aac58dab1fe2b95f080aedd7ec89619caeaa50fedbce8d06c35","source":{"kind":"arxiv","id":"1907.01679","version":1},"attestation_state":"computed","paper":{"title":"Build It, Break It, Fix It: Contesting Secure Development","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew Ruef, Daniel Votipka, Dave Levin, James Parker, Kelsey R. Fulton, Michael Hicks, Michelle L. Mazurek, Piotr Mardziel","submitted_at":"2019-07-02T23:30:52Z","abstract_excerpt":"Typical security contests focus on breaking or mitigating the impact of buggy systems. We present the Build-it, Break-it, Fix-it (BIBIFI) contest, which aims to assess the ability to securely build software, not just break it. In BIBIFI, teams build specified software with the goal of maximizing correctness, performance, and security. The latter is tested when teams attempt to break other teams' submissions. Winners are chosen from among the best builders and the best breakers. BIBIFI was designed to be open-ended; teams can use any language, tool, process, etc. that they like. As such, contes"},"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":"1907.01679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-02T23:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"88ec3584be9052e5bd48aaba562bf92c6963807925702f798d7c7adcd08ceb29","abstract_canon_sha256":"835191e57d9af2524a81562c4d762da12b22a767edc16a948ba6b3ff046a035e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:35.513028Z","signature_b64":"eSLv1N2ttO/2EbTxwk+Rg1IR218/RYxPqC2oLOYCaZb82ygqJFGkaY/Lysi+t5sZHTf/rOoeBOX9Jylcq/g3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81ca0dcca6a0aac58dab1fe2b95f080aedd7ec89619caeaa50fedbce8d06c35","last_reissued_at":"2026-05-17T23:41:35.512420Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:35.512420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Build It, Break It, Fix It: Contesting Secure Development","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew Ruef, Daniel Votipka, Dave Levin, James Parker, Kelsey R. Fulton, Michael Hicks, Michelle L. Mazurek, Piotr Mardziel","submitted_at":"2019-07-02T23:30:52Z","abstract_excerpt":"Typical security contests focus on breaking or mitigating the impact of buggy systems. We present the Build-it, Break-it, Fix-it (BIBIFI) contest, which aims to assess the ability to securely build software, not just break it. In BIBIFI, teams build specified software with the goal of maximizing correctness, performance, and security. The latter is tested when teams attempt to break other teams' submissions. Winners are chosen from among the best builders and the best breakers. BIBIFI was designed to be open-ended; teams can use any language, tool, process, etc. that they like. As such, contes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01679","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":"1907.01679","created_at":"2026-05-17T23:41:35.512525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01679v1","created_at":"2026-05-17T23:41:35.512525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01679","created_at":"2026-05-17T23:41:35.512525+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AOKBXGKNIFK","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AOKBXGKNIFKYWG2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AOKBXGK","created_at":"2026-05-18T12:33:07.085635+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/3AOKBXGKNIFKYWG2WH7CXFPQQC","json":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC.json","graph_json":"https://pith.science/api/pith-number/3AOKBXGKNIFKYWG2WH7CXFPQQC/graph.json","events_json":"https://pith.science/api/pith-number/3AOKBXGKNIFKYWG2WH7CXFPQQC/events.json","paper":"https://pith.science/paper/3AOKBXGK"},"agent_actions":{"view_html":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC","download_json":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC.json","view_paper":"https://pith.science/paper/3AOKBXGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01679&json=true","fetch_graph":"https://pith.science/api/pith-number/3AOKBXGKNIFKYWG2WH7CXFPQQC/graph.json","fetch_events":"https://pith.science/api/pith-number/3AOKBXGKNIFKYWG2WH7CXFPQQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC/action/storage_attestation","attest_author":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC/action/author_attestation","sign_citation":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC/action/citation_signature","submit_replication":"https://pith.science/pith/3AOKBXGKNIFKYWG2WH7CXFPQQC/action/replication_record"}},"created_at":"2026-05-17T23:41:35.512525+00:00","updated_at":"2026-05-17T23:41:35.512525+00:00"}