{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GUVTGCO5AHJBVAUHHQEP45DCMV","short_pith_number":"pith:GUVTGCO5","canonical_record":{"source":{"id":"2509.21886","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-26T05:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"60377d88dc28bd72de3d6ea87672ac18f709775e4944fca01a2a97f1c71e7478","abstract_canon_sha256":"8118094a1527fbd751671a1ed800f9369073bd06b2d3bbc63d9b983591e5ba5b"},"schema_version":"1.0"},"canonical_sha256":"352b3309dd01d21a82873c08fe74626553e07e60efa1a5aa83961c1a09d125da","source":{"kind":"arxiv","id":"2509.21886","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.21886","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"2509.21886v3","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.21886","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"GUVTGCO5AHJB","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"GUVTGCO5AHJBVAUH","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"GUVTGCO5","created_at":"2026-06-19T16:09:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GUVTGCO5AHJBVAUHHQEP45DCMV","target":"record","payload":{"canonical_record":{"source":{"id":"2509.21886","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-26T05:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"60377d88dc28bd72de3d6ea87672ac18f709775e4944fca01a2a97f1c71e7478","abstract_canon_sha256":"8118094a1527fbd751671a1ed800f9369073bd06b2d3bbc63d9b983591e5ba5b"},"schema_version":"1.0"},"canonical_sha256":"352b3309dd01d21a82873c08fe74626553e07e60efa1a5aa83961c1a09d125da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:51.259344Z","signature_b64":"CzbffnMaPGbTByyWby0d7PzqmTekjjTy6mpK+JBmdebElYcD5Bu52xJnWMcT/PVKZgUGKRuH4roC3R9Kgd/GDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"352b3309dd01d21a82873c08fe74626553e07e60efa1a5aa83961c1a09d125da","last_reissued_at":"2026-06-19T16:09:51.258950Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:51.258950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.21886","source_version":3,"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-06-19T16:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoESa1lFZ/pxmYI76ijbOq3THdMQHnpP+WoEhycb0INgRZ6aZdZdeSlfUW4Quk3ZBKbgzpPXadp4YwQ2NFYtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:53:31.540311Z"},"content_sha256":"1e51bdf2e39da8f6899bd0b8ccad063d25b64bd8d04203bf8bfdff40c1be5536","schema_version":"1.0","event_id":"sha256:1e51bdf2e39da8f6899bd0b8ccad063d25b64bd8d04203bf8bfdff40c1be5536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GUVTGCO5AHJBVAUHHQEP45DCMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TRACE: Learning to Compute on Circuit Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiaying Zhu, Jingyi Zhou, Qiang Xu, Ziyang Zheng","submitted_at":"2025-09-26T05:22:32Z","abstract_excerpt":"Learning to compute, the ability to model the functional behavior of a circuit graph, is a fundamental challenge for graph representation learning. Yet, the dominant paradigm is architecturally mismatched for this task. This flawed assumption, central to mainstream message passing neural networks (MPNNs) and their conventional Transformer-based counterparts, prevents models from capturing the position-aware, hierarchical nature of computation. To resolve this, we introduce TRACE, a new paradigm built on an architecturally sound backbone and a principled learning objective. First, TRACE employs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.21886","kind":"arxiv","version":3},"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/2509.21886/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-06-19T16:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NHVMfHRMWXmlYxtGXlki1QlPZlc2noEXe+otDPriekS6vAwkfJ8qHxFZtInqWfBw69zNCF0X0ovtqVH1Q0RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:53:31.540809Z"},"content_sha256":"582cd37bd02c6ab182b8f568b3a547dabd8251397140078e5d19da606afb6796","schema_version":"1.0","event_id":"sha256:582cd37bd02c6ab182b8f568b3a547dabd8251397140078e5d19da606afb6796"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUVTGCO5AHJBVAUHHQEP45DCMV/bundle.json","state_url":"https://pith.science/pith/GUVTGCO5AHJBVAUHHQEP45DCMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUVTGCO5AHJBVAUHHQEP45DCMV/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-17T17:53:31Z","links":{"resolver":"https://pith.science/pith/GUVTGCO5AHJBVAUHHQEP45DCMV","bundle":"https://pith.science/pith/GUVTGCO5AHJBVAUHHQEP45DCMV/bundle.json","state":"https://pith.science/pith/GUVTGCO5AHJBVAUHHQEP45DCMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUVTGCO5AHJBVAUHHQEP45DCMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GUVTGCO5AHJBVAUHHQEP45DCMV","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":"8118094a1527fbd751671a1ed800f9369073bd06b2d3bbc63d9b983591e5ba5b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-26T05:22:32Z","title_canon_sha256":"60377d88dc28bd72de3d6ea87672ac18f709775e4944fca01a2a97f1c71e7478"},"schema_version":"1.0","source":{"id":"2509.21886","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.21886","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"2509.21886v3","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.21886","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"GUVTGCO5AHJB","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"GUVTGCO5AHJBVAUH","created_at":"2026-06-19T16:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"GUVTGCO5","created_at":"2026-06-19T16:09:51Z"}],"graph_snapshots":[{"event_id":"sha256:582cd37bd02c6ab182b8f568b3a547dabd8251397140078e5d19da606afb6796","target":"graph","created_at":"2026-06-19T16:09: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/2509.21886/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning to compute, the ability to model the functional behavior of a circuit graph, is a fundamental challenge for graph representation learning. Yet, the dominant paradigm is architecturally mismatched for this task. This flawed assumption, central to mainstream message passing neural networks (MPNNs) and their conventional Transformer-based counterparts, prevents models from capturing the position-aware, hierarchical nature of computation. To resolve this, we introduce TRACE, a new paradigm built on an architecturally sound backbone and a principled learning objective. First, TRACE employs","authors_text":"Jiaying Zhu, Jingyi Zhou, Qiang Xu, Ziyang Zheng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.21886","kind":"arxiv","version":3},"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:1e51bdf2e39da8f6899bd0b8ccad063d25b64bd8d04203bf8bfdff40c1be5536","target":"record","created_at":"2026-06-19T16:09: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":"8118094a1527fbd751671a1ed800f9369073bd06b2d3bbc63d9b983591e5ba5b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-26T05:22:32Z","title_canon_sha256":"60377d88dc28bd72de3d6ea87672ac18f709775e4944fca01a2a97f1c71e7478"},"schema_version":"1.0","source":{"id":"2509.21886","kind":"arxiv","version":3}},"canonical_sha256":"352b3309dd01d21a82873c08fe74626553e07e60efa1a5aa83961c1a09d125da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"352b3309dd01d21a82873c08fe74626553e07e60efa1a5aa83961c1a09d125da","first_computed_at":"2026-06-19T16:09:51.258950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:51.258950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CzbffnMaPGbTByyWby0d7PzqmTekjjTy6mpK+JBmdebElYcD5Bu52xJnWMcT/PVKZgUGKRuH4roC3R9Kgd/GDw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:51.259344Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.21886","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e51bdf2e39da8f6899bd0b8ccad063d25b64bd8d04203bf8bfdff40c1be5536","sha256:582cd37bd02c6ab182b8f568b3a547dabd8251397140078e5d19da606afb6796"],"state_sha256":"92899d95d75ab2e4e2436ea461989d37b0d73253a93baf424899ef443daaf6a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iNh951yfDdgjqVcRhmOblOATp7ywBcUvGvRhLPd4PCDZeroj5DoJZPENNaHbIlLqdCIXAEHil/0w/RYRgpuTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:53:31.545604Z","bundle_sha256":"b659a06187834bdc532d995c1c1840c099962bfcf8a4124c647af51078088726"}}