{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NKSC4GOB5VNRRTS2XV6AIGZKBP","short_pith_number":"pith:NKSC4GOB","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"},"canonical_sha256":"6aa42e19c1ed5b18ce5abd7c041b2a0be8d3fbf13f54969a39a9f898488a6a18","source":{"kind":"arxiv","id":"2411.10481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10481","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10481v1","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10481","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"NKSC4GOB5VNR","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"NKSC4GOB5VNRRTS2","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"NKSC4GOB","created_at":"2026-07-05T09:36:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NKSC4GOB5VNRRTS2XV6AIGZKBP","target":"record","payload":{"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"},"canonical_sha256":"6aa42e19c1ed5b18ce5abd7c041b2a0be8d3fbf13f54969a39a9f898488a6a18","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"},"source_kind":"arxiv","source_id":"2411.10481","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkByU9F3ITK/HnsJ0vX8hK45zNECJuHG8GlYlpnQmTpe82vCo+7ZAOMl7Ii0COnDFRcMAfb5c8DDV1LIBChDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:40:46.357074Z"},"content_sha256":"71c488b249b1ea316a9c894e146232f0e63119bb65131e2a77995bd70e1b1bfb","schema_version":"1.0","event_id":"sha256:71c488b249b1ea316a9c894e146232f0e63119bb65131e2a77995bd70e1b1bfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NKSC4GOB5VNRRTS2XV6AIGZKBP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FyWHYGStdewnTX0xP5oMHxr5o5VUifZJfVG40lcU5Crsg2wUo3S/oHnHd7E51Iz6cGtWPrEkuxpl64PIzMrhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:40:46.357635Z"},"content_sha256":"8fa8af6b6ba0341a0936ad8e9b56345c472f55063dccf7edcd976eb05fa12e2e","schema_version":"1.0","event_id":"sha256:8fa8af6b6ba0341a0936ad8e9b56345c472f55063dccf7edcd976eb05fa12e2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/bundle.json","state_url":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T08:40:46Z","links":{"resolver":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP","bundle":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/bundle.json","state":"https://pith.science/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKSC4GOB5VNRRTS2XV6AIGZKBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NKSC4GOB5VNRRTS2XV6AIGZKBP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"729b47ebc5fdaabc8811bdea3d48e4fb289cfeaae85b1767699be59cc6fda779","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-13T08:38:21Z","title_canon_sha256":"bafe003028dd4e68bf0696b48d554bfd7cb57f6180f5c2fa0252fec6b2bf8744"},"schema_version":"1.0","source":{"id":"2411.10481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10481","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10481v1","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10481","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"NKSC4GOB5VNR","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"NKSC4GOB5VNRRTS2","created_at":"2026-07-05T09:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"NKSC4GOB","created_at":"2026-07-05T09:36:51Z"}],"graph_snapshots":[{"event_id":"sha256:8fa8af6b6ba0341a0936ad8e9b56345c472f55063dccf7edcd976eb05fa12e2e","target":"graph","created_at":"2026-07-05T09:36:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.10481/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Biwei Xie, Huawei Li, Liwei Ni, Xinquan Li","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-13T08:38:21Z","title":"Boolean-aware Boolean Circuit Classification: A Comprehensive Study on Graph Neural Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10481","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:71c488b249b1ea316a9c894e146232f0e63119bb65131e2a77995bd70e1b1bfb","target":"record","created_at":"2026-07-05T09:36:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"729b47ebc5fdaabc8811bdea3d48e4fb289cfeaae85b1767699be59cc6fda779","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-13T08:38:21Z","title_canon_sha256":"bafe003028dd4e68bf0696b48d554bfd7cb57f6180f5c2fa0252fec6b2bf8744"},"schema_version":"1.0","source":{"id":"2411.10481","kind":"arxiv","version":1}},"canonical_sha256":"6aa42e19c1ed5b18ce5abd7c041b2a0be8d3fbf13f54969a39a9f898488a6a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aa42e19c1ed5b18ce5abd7c041b2a0be8d3fbf13f54969a39a9f898488a6a18","first_computed_at":"2026-07-05T09:36:51.268090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:51.268090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vxjgqclh+joUrh/qLVRX4ovLHyLrKUpoVAUF2Wdwgk5bFtmuow7LxdJgPDvtnXkE6F7MFF2QCx5jNgn23H3sBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:51.268545Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.10481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c488b249b1ea316a9c894e146232f0e63119bb65131e2a77995bd70e1b1bfb","sha256:8fa8af6b6ba0341a0936ad8e9b56345c472f55063dccf7edcd976eb05fa12e2e"],"state_sha256":"98c15bf8efbe13d0ca0284078fcf2e227f44a6bb84e637cfca485fe091c672fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeWZBD8TvUzqcru/H/uy7l3bgm+9jvwkTRoJpE5cE+0yPQd4pxzBUh7CvDNLEWtpl4oNEoDOhUkTdfvSmCUGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:40:46.362088Z","bundle_sha256":"45aa3cb8ce360858337477f4d26212b89b9d2a1892a6cda0efe465ed1830a022"}}