{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IZCCMIZM6HPLBIC5TZK3CFMFZ5","short_pith_number":"pith:IZCCMIZM","schema_version":"1.0","canonical_sha256":"464426232cf1deb0a05d9e55b11585cf75ad5c1e5025f37c29ef80f4af263f74","source":{"kind":"arxiv","id":"1704.04772","version":1},"attestation_state":"computed","paper":{"title":"A Random Walk Based Algorithm for Structural Test Case Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"He Jiang, Jifeng Xuan, Yan Hu, Zhilei Ren, Zhongxuan Luo","submitted_at":"2017-04-16T13:05:50Z","abstract_excerpt":"Structural testing is a significant and expensive process in software development. By converting test data generation into an optimization problem, search-based software testing is one of the key technologies of automated test case generation. Motivated by the success of random walk in solving the satisfiability problem (SAT), we proposed a random walk based algorithm (WalkTest) to solve structural test case generation problem. WalkTest provides a framework, which iteratively calls random walk operator to search the optimal solutions. In order to improve search efficiency, we sorted the test g"},"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":"1704.04772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-16T13:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"296a2793202a3525babbe3e623c44edd98f2757d9cdee496ddaa4334047a9145","abstract_canon_sha256":"c72c78ae2e3e2d90330a542217cd88a65937da04c8d5c8f6dedef45f3f447ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.779433Z","signature_b64":"ABorIsy3MT7wqcVybh0doVPh5PYjsiPfMpQ6P2bcJ3IvzqDQqWlYSLHhZiNPbT/5vi7G00NaxBrewL1iXeOGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"464426232cf1deb0a05d9e55b11585cf75ad5c1e5025f37c29ef80f4af263f74","last_reissued_at":"2026-05-18T00:46:17.778889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.778889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Random Walk Based Algorithm for Structural Test Case Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"He Jiang, Jifeng Xuan, Yan Hu, Zhilei Ren, Zhongxuan Luo","submitted_at":"2017-04-16T13:05:50Z","abstract_excerpt":"Structural testing is a significant and expensive process in software development. By converting test data generation into an optimization problem, search-based software testing is one of the key technologies of automated test case generation. Motivated by the success of random walk in solving the satisfiability problem (SAT), we proposed a random walk based algorithm (WalkTest) to solve structural test case generation problem. WalkTest provides a framework, which iteratively calls random walk operator to search the optimal solutions. In order to improve search efficiency, we sorted the test g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04772","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":"1704.04772","created_at":"2026-05-18T00:46:17.778972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04772v1","created_at":"2026-05-18T00:46:17.778972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04772","created_at":"2026-05-18T00:46:17.778972+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZCCMIZM6HPL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZCCMIZM6HPLBIC5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZCCMIZM","created_at":"2026-05-18T12:31:21.493067+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/IZCCMIZM6HPLBIC5TZK3CFMFZ5","json":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5.json","graph_json":"https://pith.science/api/pith-number/IZCCMIZM6HPLBIC5TZK3CFMFZ5/graph.json","events_json":"https://pith.science/api/pith-number/IZCCMIZM6HPLBIC5TZK3CFMFZ5/events.json","paper":"https://pith.science/paper/IZCCMIZM"},"agent_actions":{"view_html":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5","download_json":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5.json","view_paper":"https://pith.science/paper/IZCCMIZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04772&json=true","fetch_graph":"https://pith.science/api/pith-number/IZCCMIZM6HPLBIC5TZK3CFMFZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/IZCCMIZM6HPLBIC5TZK3CFMFZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5/action/storage_attestation","attest_author":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5/action/author_attestation","sign_citation":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5/action/citation_signature","submit_replication":"https://pith.science/pith/IZCCMIZM6HPLBIC5TZK3CFMFZ5/action/replication_record"}},"created_at":"2026-05-18T00:46:17.778972+00:00","updated_at":"2026-05-18T00:46:17.778972+00:00"}