{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:6HUD7VWHOGM676NFRQXDJOZTI3","short_pith_number":"pith:6HUD7VWH","schema_version":"1.0","canonical_sha256":"f1e83fd6c77199eff9a58c2e34bb3346c44b988a80832ec64855e8e8d28697e8","source":{"kind":"arxiv","id":"0710.4670","version":1},"attestation_state":"computed","paper":{"title":"Evolutionary Optimization in Code-Based Test Compression","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alejandro Czutro, Bernd Becker, Ilia Polian","submitted_at":"2007-10-25T08:45:52Z","abstract_excerpt":"We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In contrast to existing code-based methods, we allow unspecified values in matching vectors, which allows encoding of arbitrary test sets using a relatively small number of code-words. Experimental results for both stuck-at and path delay fault test sets for ISCAS circuits demonstrate an improvement compared to existing techniques."},"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":"0710.4670","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AR","submitted_at":"2007-10-25T08:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"52ae65f0aec426fc6a8a51a5a50c38c07b835620a8fbd8aa4aac05c98447840e","abstract_canon_sha256":"8d442c5f79c5b9857585019941754c693c7f6eaea0731f457fa2f2cc625c353a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:06.046506Z","signature_b64":"Xb5TIrqVG5R9HOSwSLRc2RaIeDYoZeKF2felmXOBs6cEqfpFLZp4SHVejbBWxoPcYQDy9bRpe/CBOzQ2OVRBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1e83fd6c77199eff9a58c2e34bb3346c44b988a80832ec64855e8e8d28697e8","last_reissued_at":"2026-05-18T04:09:06.045733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:06.045733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolutionary Optimization in Code-Based Test Compression","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alejandro Czutro, Bernd Becker, Ilia Polian","submitted_at":"2007-10-25T08:45:52Z","abstract_excerpt":"We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In contrast to existing code-based methods, we allow unspecified values in matching vectors, which allows encoding of arbitrary test sets using a relatively small number of code-words. Experimental results for both stuck-at and path delay fault test sets for ISCAS circuits demonstrate an improvement compared to existing techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4670","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":"0710.4670","created_at":"2026-05-18T04:09:06.045865+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4670v1","created_at":"2026-05-18T04:09:06.045865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4670","created_at":"2026-05-18T04:09:06.045865+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HUD7VWHOGM6","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HUD7VWHOGM676NF","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HUD7VWH","created_at":"2026-05-18T12:25:55.427421+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/6HUD7VWHOGM676NFRQXDJOZTI3","json":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3.json","graph_json":"https://pith.science/api/pith-number/6HUD7VWHOGM676NFRQXDJOZTI3/graph.json","events_json":"https://pith.science/api/pith-number/6HUD7VWHOGM676NFRQXDJOZTI3/events.json","paper":"https://pith.science/paper/6HUD7VWH"},"agent_actions":{"view_html":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3","download_json":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3.json","view_paper":"https://pith.science/paper/6HUD7VWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4670&json=true","fetch_graph":"https://pith.science/api/pith-number/6HUD7VWHOGM676NFRQXDJOZTI3/graph.json","fetch_events":"https://pith.science/api/pith-number/6HUD7VWHOGM676NFRQXDJOZTI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3/action/storage_attestation","attest_author":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3/action/author_attestation","sign_citation":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3/action/citation_signature","submit_replication":"https://pith.science/pith/6HUD7VWHOGM676NFRQXDJOZTI3/action/replication_record"}},"created_at":"2026-05-18T04:09:06.045865+00:00","updated_at":"2026-05-18T04:09:06.045865+00:00"}