{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7VAW5CSZ75XNHZH2RYYQ6DGQA3","short_pith_number":"pith:7VAW5CSZ","canonical_record":{"source":{"id":"2512.08964","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-30T01:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"6298332ac483bd61fc9a85601f65416e8e6d894e3a43b3c69d0902e49b08b6f5","abstract_canon_sha256":"55443733152c06c552912be1d3815a9dd5576dd4b1e265ef58c4547151768fe8"},"schema_version":"1.0"},"canonical_sha256":"fd416e8a59ff6ed3e4fa8e310f0cd006e35eb99b2e44f8584e31d9c4f44c10df","source":{"kind":"arxiv","id":"2512.08964","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08964","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08964v4","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08964","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"7VAW5CSZ75XN","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_16","alias_value":"7VAW5CSZ75XNHZH2","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_8","alias_value":"7VAW5CSZ","created_at":"2026-05-20T00:01:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7VAW5CSZ75XNHZH2RYYQ6DGQA3","target":"record","payload":{"canonical_record":{"source":{"id":"2512.08964","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-30T01:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"6298332ac483bd61fc9a85601f65416e8e6d894e3a43b3c69d0902e49b08b6f5","abstract_canon_sha256":"55443733152c06c552912be1d3815a9dd5576dd4b1e265ef58c4547151768fe8"},"schema_version":"1.0"},"canonical_sha256":"fd416e8a59ff6ed3e4fa8e310f0cd006e35eb99b2e44f8584e31d9c4f44c10df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:37.630748Z","signature_b64":"gdzNTKFLbVmWctM16rRMpNp/LoZfTwCFymOOnOHd+c8KclrVS4szTpwq6eS49Tprs+oRtPH1+n/Vy9qALqJRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd416e8a59ff6ed3e4fa8e310f0cd006e35eb99b2e44f8584e31d9c4f44c10df","last_reissued_at":"2026-05-20T00:01:37.629932Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:37.629932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.08964","source_version":4,"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-05-20T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYeyvRHKtT3XJQkPxozZLyw/LWpydaIDKR+E3hvZ1SSMKPEGINL5hBvnQBPA/Ko1jW/8HLIWKHOW35+JeQqzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:24:13.015648Z"},"content_sha256":"d7fba44ff4bbeb0bc8f4e54edf528a5a9622df13417f51241c083f3578c57842","schema_version":"1.0","event_id":"sha256:d7fba44ff4bbeb0bc8f4e54edf528a5a9622df13417f51241c083f3578c57842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7VAW5CSZ75XNHZH2RYYQ6DGQA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yongyu Wang","submitted_at":"2025-11-30T01:40:15Z","abstract_excerpt":"Graph learning aims to convert data into graph representations, which are fundamental to many problems in machine learning for CAD, where circuits, layouts, designs, and optimization states are often modeled as graph-structured objects. Existing graph learning methods usually rely on carefully designed graph construction rules, extensive parameter tuning, and sophisticated mathematical theory; moreover, achieving good performance often requires task-specific graph construction tailored to the downstream objective. In this work, we study whether a large language model (LLM) can reason about gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08964","kind":"arxiv","version":4},"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/2512.08964/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-05-20T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZJ/cdezAAkjbCRF/EQeVfJn8D5vBYbBbFHNs4B2ZcjxQ2o9HjEkquU+PHKKDa973iSVCy++bUqmwGiG3jc7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:24:13.016029Z"},"content_sha256":"647161dd29f6d9681e1fdd489c63338c3e8db74083e34ecaaa0b4312bc2b42a7","schema_version":"1.0","event_id":"sha256:647161dd29f6d9681e1fdd489c63338c3e8db74083e34ecaaa0b4312bc2b42a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3/bundle.json","state_url":"https://pith.science/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3/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-06-02T13:24:13Z","links":{"resolver":"https://pith.science/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3","bundle":"https://pith.science/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3/bundle.json","state":"https://pith.science/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VAW5CSZ75XNHZH2RYYQ6DGQA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7VAW5CSZ75XNHZH2RYYQ6DGQA3","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":"55443733152c06c552912be1d3815a9dd5576dd4b1e265ef58c4547151768fe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-30T01:40:15Z","title_canon_sha256":"6298332ac483bd61fc9a85601f65416e8e6d894e3a43b3c69d0902e49b08b6f5"},"schema_version":"1.0","source":{"id":"2512.08964","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08964","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08964v4","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08964","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"7VAW5CSZ75XN","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_16","alias_value":"7VAW5CSZ75XNHZH2","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_8","alias_value":"7VAW5CSZ","created_at":"2026-05-20T00:01:37Z"}],"graph_snapshots":[{"event_id":"sha256:647161dd29f6d9681e1fdd489c63338c3e8db74083e34ecaaa0b4312bc2b42a7","target":"graph","created_at":"2026-05-20T00:01:37Z","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/2512.08964/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph learning aims to convert data into graph representations, which are fundamental to many problems in machine learning for CAD, where circuits, layouts, designs, and optimization states are often modeled as graph-structured objects. Existing graph learning methods usually rely on carefully designed graph construction rules, extensive parameter tuning, and sophisticated mathematical theory; moreover, achieving good performance often requires task-specific graph construction tailored to the downstream objective. In this work, we study whether a large language model (LLM) can reason about gra","authors_text":"Yongyu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-30T01:40:15Z","title":"T2T-LA: A Topology-to-Topology LLM Agent for Graph Learning with Neither Feature Access nor Task Knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08964","kind":"arxiv","version":4},"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:d7fba44ff4bbeb0bc8f4e54edf528a5a9622df13417f51241c083f3578c57842","target":"record","created_at":"2026-05-20T00:01:37Z","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":"55443733152c06c552912be1d3815a9dd5576dd4b1e265ef58c4547151768fe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-30T01:40:15Z","title_canon_sha256":"6298332ac483bd61fc9a85601f65416e8e6d894e3a43b3c69d0902e49b08b6f5"},"schema_version":"1.0","source":{"id":"2512.08964","kind":"arxiv","version":4}},"canonical_sha256":"fd416e8a59ff6ed3e4fa8e310f0cd006e35eb99b2e44f8584e31d9c4f44c10df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd416e8a59ff6ed3e4fa8e310f0cd006e35eb99b2e44f8584e31d9c4f44c10df","first_computed_at":"2026-05-20T00:01:37.629932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:37.629932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gdzNTKFLbVmWctM16rRMpNp/LoZfTwCFymOOnOHd+c8KclrVS4szTpwq6eS49Tprs+oRtPH1+n/Vy9qALqJRDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:37.630748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.08964","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7fba44ff4bbeb0bc8f4e54edf528a5a9622df13417f51241c083f3578c57842","sha256:647161dd29f6d9681e1fdd489c63338c3e8db74083e34ecaaa0b4312bc2b42a7"],"state_sha256":"73a19bb208fce3e1d40d2b6782f8ca82d472ea49e361d0c3ff4ffc514f87cf6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiHjMT0uKE4TcKJCVG54tUebdCx62gtW/RX4vpz68o+XLA12wkFI/EIimJko82hISxtyl8V7U34opvbQgBPnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:24:13.018366Z","bundle_sha256":"ae4a10eff2537c75765e302bcafb3203a3347a46cc3c7acf58c1bc36436d599c"}}