{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GR3NJKRPZM7HDBWKEFQN3ZGWDN","short_pith_number":"pith:GR3NJKRP","schema_version":"1.0","canonical_sha256":"3476d4aa2fcb3e7186ca2160dde4d61b5dabac49c644b213188341386f2d7552","source":{"kind":"arxiv","id":"1708.04597","version":2},"attestation_state":"computed","paper":{"title":"An Efficient NPN Boolean Matching Algorithm Based on Structural Signature and Shannon Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guowu Yang, Juling Zhang, William N. N. Hung, Yan Zhang","submitted_at":"2017-08-11T05:30:48Z","abstract_excerpt":"An efficient pairwise Boolean matching algorithm to solve the problem of matching single-output specified Boolean functions under input negation and/or input permutation and/or output negation (NPN) is proposed in this paper. We present the Structural Signature (SS) vector, which is composed of a 1st signature value, two symmetry marks, and a group mark. As a necessary condition for NPN Boolean matching, the structural signature is more effective than is the traditional signature. Two Boolean functions, f and g, may be equivalent when they have the same SS vector. The symmetry mark can disting"},"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":"1708.04597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-11T05:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"a84b69232ecd0286445881b64442f0fc8b30821c9304f1f772f8633b00e2e59e","abstract_canon_sha256":"85f5f70dc2e06994d82bd42eb65fd32bc7b861752de7ee6235f4d969578a3467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:57.456247Z","signature_b64":"t1pz2N3TrNk3SgYtOJHI50lieg8gyC/AyqyuW5WrDSseXmh1GVHouigr/0UeWSH34Gol13NEUtJ+meKhNyAuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3476d4aa2fcb3e7186ca2160dde4d61b5dabac49c644b213188341386f2d7552","last_reissued_at":"2026-05-18T00:30:57.455744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:57.455744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient NPN Boolean Matching Algorithm Based on Structural Signature and Shannon Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guowu Yang, Juling Zhang, William N. N. Hung, Yan Zhang","submitted_at":"2017-08-11T05:30:48Z","abstract_excerpt":"An efficient pairwise Boolean matching algorithm to solve the problem of matching single-output specified Boolean functions under input negation and/or input permutation and/or output negation (NPN) is proposed in this paper. We present the Structural Signature (SS) vector, which is composed of a 1st signature value, two symmetry marks, and a group mark. As a necessary condition for NPN Boolean matching, the structural signature is more effective than is the traditional signature. Two Boolean functions, f and g, may be equivalent when they have the same SS vector. The symmetry mark can disting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04597","kind":"arxiv","version":2},"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":"1708.04597","created_at":"2026-05-18T00:30:57.455815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04597v2","created_at":"2026-05-18T00:30:57.455815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04597","created_at":"2026-05-18T00:30:57.455815+00:00"},{"alias_kind":"pith_short_12","alias_value":"GR3NJKRPZM7H","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GR3NJKRPZM7HDBWK","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GR3NJKRP","created_at":"2026-05-18T12:31:18.294218+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/GR3NJKRPZM7HDBWKEFQN3ZGWDN","json":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN.json","graph_json":"https://pith.science/api/pith-number/GR3NJKRPZM7HDBWKEFQN3ZGWDN/graph.json","events_json":"https://pith.science/api/pith-number/GR3NJKRPZM7HDBWKEFQN3ZGWDN/events.json","paper":"https://pith.science/paper/GR3NJKRP"},"agent_actions":{"view_html":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN","download_json":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN.json","view_paper":"https://pith.science/paper/GR3NJKRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04597&json=true","fetch_graph":"https://pith.science/api/pith-number/GR3NJKRPZM7HDBWKEFQN3ZGWDN/graph.json","fetch_events":"https://pith.science/api/pith-number/GR3NJKRPZM7HDBWKEFQN3ZGWDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN/action/storage_attestation","attest_author":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN/action/author_attestation","sign_citation":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN/action/citation_signature","submit_replication":"https://pith.science/pith/GR3NJKRPZM7HDBWKEFQN3ZGWDN/action/replication_record"}},"created_at":"2026-05-18T00:30:57.455815+00:00","updated_at":"2026-05-18T00:30:57.455815+00:00"}