{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NKSC4GOB5VNRRTS2XV6AIGZKBP","short_pith_number":"pith:NKSC4GOB","schema_version":"1.0","canonical_sha256":"6aa42e19c1ed5b18ce5abd7c041b2a0be8d3fbf13f54969a39a9f898488a6a18","source":{"kind":"arxiv","id":"2411.10481","version":1},"attestation_state":"computed","paper":{"title":"Boolean-aware Boolean Circuit Classification: A Comprehensive Study on Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Biwei Xie, Huawei Li, Liwei Ni, Xinquan Li","submitted_at":"2024-11-13T08:38:21Z","abstract_excerpt":"Boolean circuit is a computational graph that consists of the dynamic directed graph structure and static functionality. The commonly used logic optimization and Boolean matching-based transformation can change the behavior of the Boolean circuit for its graph structure and functionality in logic synthesis. The graph structure-based Boolean circuit classification can be grouped into the graph classification task, however, the functionality-based Boolean circuit classification remains an open problem for further research. In this paper, we first define the proposed matching-equivalent class bas"},"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":"2411.10481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-13T08:38:21Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"bafe003028dd4e68bf0696b48d554bfd7cb57f6180f5c2fa0252fec6b2bf8744","abstract_canon_sha256":"729b47ebc5fdaabc8811bdea3d48e4fb289cfeaae85b1767699be59cc6fda779"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:51.268545Z","signature_b64":"Vxjgqclh+joUrh/qLVRX4ovLHyLrKUpoVAUF2Wdwgk5bFtmuow7LxdJgPDvtnXkE6F7MFF2QCx5jNgn23H3sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aa42e19c1ed5b18ce5abd7c041b2a0be8d3fbf13f54969a39a9f898488a6a18","last_reissued_at":"2026-07-05T09:36:51.268090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:51.268090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean-aware Boolean Circuit Classification: A Comprehensive Study on Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Biwei Xie, Huawei Li, Liwei Ni, Xinquan Li","submitted_at":"2024-11-13T08:38:21Z","abstract_excerpt":"Boolean circuit is a computational graph that consists of the dynamic directed graph structure and static functionality. The commonly used logic optimization and Boolean matching-based transformation can change the behavior of the Boolean circuit for its graph structure and functionality in logic synthesis. The graph structure-based Boolean circuit classification can be grouped into the graph classification task, however, the functionality-based Boolean circuit classification remains an open problem for further research. In this paper, we first define the proposed matching-equivalent class bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10481","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/2411.10481/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":"2411.10481","created_at":"2026-07-05T09:36:51.268154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10481v1","created_at":"2026-07-05T09:36:51.268154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10481","created_at":"2026-07-05T09:36:51.268154+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKSC4GOB5VNR","created_at":"2026-07-05T09:36:51.268154+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKSC4GOB5VNRRTS2","created_at":"2026-07-05T09:36:51.268154+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKSC4GOB","created_at":"2026-07-05T09:36:51.268154+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/NKSC4GOB5VNRRTS2XV6AIGZKBP","json":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP.json","graph_json":"https://pith.science/api/pith-number/NKSC4GOB5VNRRTS2XV6AIGZKBP/graph.json","events_json":"https://pith.science/api/pith-number/NKSC4GOB5VNRRTS2XV6AIGZKBP/events.json","paper":"https://pith.science/paper/NKSC4GOB"},"agent_actions":{"view_html":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP","download_json":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP.json","view_paper":"https://pith.science/paper/NKSC4GOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10481&json=true","fetch_graph":"https://pith.science/api/pith-number/NKSC4GOB5VNRRTS2XV6AIGZKBP/graph.json","fetch_events":"https://pith.science/api/pith-number/NKSC4GOB5VNRRTS2XV6AIGZKBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/action/storage_attestation","attest_author":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/action/author_attestation","sign_citation":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/action/citation_signature","submit_replication":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/action/replication_record"}},"created_at":"2026-07-05T09:36:51.268154+00:00","updated_at":"2026-07-05T09:36:51.268154+00:00"}