{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SWFMVIZYITF7A4LNBFVMRDGDKQ","short_pith_number":"pith:SWFMVIZY","schema_version":"1.0","canonical_sha256":"958acaa33844cbf0716d096ac88cc3543a66d7d022e91e4bae8f1afc54660bcd","source":{"kind":"arxiv","id":"1508.00481","version":1},"attestation_state":"computed","paper":{"title":"A combinatorial approach to X-tolerant compaction circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Charles J. Colbourn, Yuichiro Fujiwara","submitted_at":"2015-08-03T16:30:58Z","abstract_excerpt":"Test response compaction for integrated circuits (ICs) with scan-based design-for-testability (DFT) support in the presence of unknown logic values (Xs) is investigated from a combinatorial viewpoint. The theoretical foundations of X-codes, employed in an X-tolerant compaction technique called X-compact, are examined. Through the formulation of a combinatorial model of X-compact, novel design techniques are developed for X-codes to detect a specified maximum number of errors in the presence of a specified maximum number of unknown logic values, while requiring only small fan-out. The special c"},"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":"1508.00481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T16:30:58Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"0f750660fb3e1fb69e0e87c28718136c806046539547989e2b668cb20e03410d","abstract_canon_sha256":"5695d88413adda0b6e61bb022ba304d6ea0290cb1e156b814dc1d200b0716e62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:57.988799Z","signature_b64":"WLsbqfs5t852gIscds79AGq0FGv28VTtj6zUHT/ZUcIYiy2BNNHfx43E/XMlGDY4UQRx7fb0zoBZDHPFQnqyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958acaa33844cbf0716d096ac88cc3543a66d7d022e91e4bae8f1afc54660bcd","last_reissued_at":"2026-05-18T01:35:57.988235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:57.988235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial approach to X-tolerant compaction circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Charles J. Colbourn, Yuichiro Fujiwara","submitted_at":"2015-08-03T16:30:58Z","abstract_excerpt":"Test response compaction for integrated circuits (ICs) with scan-based design-for-testability (DFT) support in the presence of unknown logic values (Xs) is investigated from a combinatorial viewpoint. The theoretical foundations of X-codes, employed in an X-tolerant compaction technique called X-compact, are examined. Through the formulation of a combinatorial model of X-compact, novel design techniques are developed for X-codes to detect a specified maximum number of errors in the presence of a specified maximum number of unknown logic values, while requiring only small fan-out. The special c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00481","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":"1508.00481","created_at":"2026-05-18T01:35:57.988326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00481v1","created_at":"2026-05-18T01:35:57.988326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00481","created_at":"2026-05-18T01:35:57.988326+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWFMVIZYITF7","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWFMVIZYITF7A4LN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWFMVIZY","created_at":"2026-05-18T12:29:42.218222+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/SWFMVIZYITF7A4LNBFVMRDGDKQ","json":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ.json","graph_json":"https://pith.science/api/pith-number/SWFMVIZYITF7A4LNBFVMRDGDKQ/graph.json","events_json":"https://pith.science/api/pith-number/SWFMVIZYITF7A4LNBFVMRDGDKQ/events.json","paper":"https://pith.science/paper/SWFMVIZY"},"agent_actions":{"view_html":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ","download_json":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ.json","view_paper":"https://pith.science/paper/SWFMVIZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00481&json=true","fetch_graph":"https://pith.science/api/pith-number/SWFMVIZYITF7A4LNBFVMRDGDKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SWFMVIZYITF7A4LNBFVMRDGDKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ/action/storage_attestation","attest_author":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ/action/author_attestation","sign_citation":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ/action/citation_signature","submit_replication":"https://pith.science/pith/SWFMVIZYITF7A4LNBFVMRDGDKQ/action/replication_record"}},"created_at":"2026-05-18T01:35:57.988326+00:00","updated_at":"2026-05-18T01:35:57.988326+00:00"}