{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:73FLN4EBZNTTV63OH5WZF3O6S5","short_pith_number":"pith:73FLN4EB","schema_version":"1.0","canonical_sha256":"fecab6f081cb673afb6e3f6d92edde9756e455732e45ce21cd6d98ded15d411e","source":{"kind":"arxiv","id":"2606.22063","version":1},"attestation_state":"computed","paper":{"title":"Guarded Equivalence Predicates for Scalable Formal Hardware Information-Flow Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Liangtao Dai, Melika Morsali, Mircea R. Stan, Yimin Gao","submitted_at":"2026-06-20T14:25:13Z","abstract_excerpt":"Formal hardware information-flow verification is a principled way to rule out secret-dependent functional or timing observations, but scaling such proofs remains difficult. Self-composition reduces information-flow verification to safety checking over two circuit copies, creating relational proof obligations that are hard for a generic PDR engine to discover from bit-level logic alone. Recent PDR-based techniques exploit this duplicated structure through copy symmetry and global cross-copy equivalence predicates. These predicates are effective when corresponding internal signals agree througho"},"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":"2606.22063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-20T14:25:13Z","cross_cats_sorted":[],"title_canon_sha256":"82274f15c362ae5e556ba0d7e25e733d909782ec690e1c8bc17c0547712b1c02","abstract_canon_sha256":"b2fe44cf30cd28c181afed02b1cb466313942b944dd18a8bddd4060ef336a0f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:06.762503Z","signature_b64":"taXmy3EwTmQZ3TYVWzAg/HnV5pv/rvckDgSkWKv7kahGn5a2hBcvZdRHhAdsK27rpTRwgEZUoL9Jayf2J7LfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fecab6f081cb673afb6e3f6d92edde9756e455732e45ce21cd6d98ded15d411e","last_reissued_at":"2026-06-23T02:13:06.762106Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:06.762106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarded Equivalence Predicates for Scalable Formal Hardware Information-Flow Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Liangtao Dai, Melika Morsali, Mircea R. Stan, Yimin Gao","submitted_at":"2026-06-20T14:25:13Z","abstract_excerpt":"Formal hardware information-flow verification is a principled way to rule out secret-dependent functional or timing observations, but scaling such proofs remains difficult. Self-composition reduces information-flow verification to safety checking over two circuit copies, creating relational proof obligations that are hard for a generic PDR engine to discover from bit-level logic alone. Recent PDR-based techniques exploit this duplicated structure through copy symmetry and global cross-copy equivalence predicates. These predicates are effective when corresponding internal signals agree througho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22063","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22063/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.22063","created_at":"2026-06-23T02:13:06.762163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22063v1","created_at":"2026-06-23T02:13:06.762163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22063","created_at":"2026-06-23T02:13:06.762163+00:00"},{"alias_kind":"pith_short_12","alias_value":"73FLN4EBZNTT","created_at":"2026-06-23T02:13:06.762163+00:00"},{"alias_kind":"pith_short_16","alias_value":"73FLN4EBZNTTV63O","created_at":"2026-06-23T02:13:06.762163+00:00"},{"alias_kind":"pith_short_8","alias_value":"73FLN4EB","created_at":"2026-06-23T02:13:06.762163+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/73FLN4EBZNTTV63OH5WZF3O6S5","json":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5.json","graph_json":"https://pith.science/api/pith-number/73FLN4EBZNTTV63OH5WZF3O6S5/graph.json","events_json":"https://pith.science/api/pith-number/73FLN4EBZNTTV63OH5WZF3O6S5/events.json","paper":"https://pith.science/paper/73FLN4EB"},"agent_actions":{"view_html":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5","download_json":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5.json","view_paper":"https://pith.science/paper/73FLN4EB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22063&json=true","fetch_graph":"https://pith.science/api/pith-number/73FLN4EBZNTTV63OH5WZF3O6S5/graph.json","fetch_events":"https://pith.science/api/pith-number/73FLN4EBZNTTV63OH5WZF3O6S5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5/action/storage_attestation","attest_author":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5/action/author_attestation","sign_citation":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5/action/citation_signature","submit_replication":"https://pith.science/pith/73FLN4EBZNTTV63OH5WZF3O6S5/action/replication_record"}},"created_at":"2026-06-23T02:13:06.762163+00:00","updated_at":"2026-06-23T02:13:06.762163+00:00"}