{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7ESKMMAQIRLS7T2X7Q5OPTA3PE","short_pith_number":"pith:7ESKMMAQ","schema_version":"1.0","canonical_sha256":"f924a6301044572fcf57fc3ae7cc1b79018f52f456fea893d2e0f4fc98334c67","source":{"kind":"arxiv","id":"1311.6606","version":1},"attestation_state":"computed","paper":{"title":"Random Grammar-based Testing for Covering All Non-Terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alois Dreyfus (UMR 6174, FEMTO-ST), INRIA Nancy - Grand Est / LORIA / LIFC), Olga Kouchnarenko (UMR 6174, Pierre-Cyrille Heam (INRIA Nancy - Grand Est / LORIA / LIFC","submitted_at":"2013-11-26T09:57:51Z","abstract_excerpt":"In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation of the data -- of a given size -- is practically impossible, and most approaches are either based on random techniques or on coverage criteria. In this paper, we show how to combine these two techniques by biasing the random generation in order to optimise the probability of satisfying a coverage criterion."},"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":"1311.6606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-11-26T09:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"f621c1a7190a611b635e23819f7b740e3feed3dc7a767f879b504307c241c9d6","abstract_canon_sha256":"b6bbc0e4a5e1c03dcf9c2a17a9dd82700f8b05e7152c62d64b631015d6739481"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.237373Z","signature_b64":"fczL5vqLD9we3cswTnmzp98uCekqkj3IiAycIqTkJ4OmDcnA3/ulxjmdLCAPzprc7tZAU1X9ZqWLRQzWR6MGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f924a6301044572fcf57fc3ae7cc1b79018f52f456fea893d2e0f4fc98334c67","last_reissued_at":"2026-05-18T03:06:12.236661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.236661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Grammar-based Testing for Covering All Non-Terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alois Dreyfus (UMR 6174, FEMTO-ST), INRIA Nancy - Grand Est / LORIA / LIFC), Olga Kouchnarenko (UMR 6174, Pierre-Cyrille Heam (INRIA Nancy - Grand Est / LORIA / LIFC","submitted_at":"2013-11-26T09:57:51Z","abstract_excerpt":"In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation of the data -- of a given size -- is practically impossible, and most approaches are either based on random techniques or on coverage criteria. In this paper, we show how to combine these two techniques by biasing the random generation in order to optimise the probability of satisfying a coverage criterion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6606","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":"1311.6606","created_at":"2026-05-18T03:06:12.236767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6606v1","created_at":"2026-05-18T03:06:12.236767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6606","created_at":"2026-05-18T03:06:12.236767+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ESKMMAQIRLS","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ESKMMAQIRLS7T2X","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ESKMMAQ","created_at":"2026-05-18T12:27:36.564083+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/7ESKMMAQIRLS7T2X7Q5OPTA3PE","json":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE.json","graph_json":"https://pith.science/api/pith-number/7ESKMMAQIRLS7T2X7Q5OPTA3PE/graph.json","events_json":"https://pith.science/api/pith-number/7ESKMMAQIRLS7T2X7Q5OPTA3PE/events.json","paper":"https://pith.science/paper/7ESKMMAQ"},"agent_actions":{"view_html":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE","download_json":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE.json","view_paper":"https://pith.science/paper/7ESKMMAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6606&json=true","fetch_graph":"https://pith.science/api/pith-number/7ESKMMAQIRLS7T2X7Q5OPTA3PE/graph.json","fetch_events":"https://pith.science/api/pith-number/7ESKMMAQIRLS7T2X7Q5OPTA3PE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE/action/storage_attestation","attest_author":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE/action/author_attestation","sign_citation":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE/action/citation_signature","submit_replication":"https://pith.science/pith/7ESKMMAQIRLS7T2X7Q5OPTA3PE/action/replication_record"}},"created_at":"2026-05-18T03:06:12.236767+00:00","updated_at":"2026-05-18T03:06:12.236767+00:00"}