{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7RIHIQSHBLZRVOIDK7BGNCVQEB","short_pith_number":"pith:7RIHIQSH","canonical_record":{"source":{"id":"2407.01440","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-01T16:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"5b9ce6a890d01546be7d19e8e0603c8ae4ead439e211851d381fd005d380f13f","abstract_canon_sha256":"f9e2721d415db9b87fa9635796da46073070c85c73ad12b5200c18b108e249b9"},"schema_version":"1.0"},"canonical_sha256":"fc507442470af31ab90357c2668ab0206cc86e42651920480e4e61674f17e3c2","source":{"kind":"arxiv","id":"2407.01440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.01440","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"arxiv_version","alias_value":"2407.01440v1","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01440","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"pith_short_12","alias_value":"7RIHIQSHBLZR","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"pith_short_16","alias_value":"7RIHIQSHBLZRVOID","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"pith_short_8","alias_value":"7RIHIQSH","created_at":"2026-07-05T08:38:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7RIHIQSHBLZRVOIDK7BGNCVQEB","target":"record","payload":{"canonical_record":{"source":{"id":"2407.01440","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-01T16:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"5b9ce6a890d01546be7d19e8e0603c8ae4ead439e211851d381fd005d380f13f","abstract_canon_sha256":"f9e2721d415db9b87fa9635796da46073070c85c73ad12b5200c18b108e249b9"},"schema_version":"1.0"},"canonical_sha256":"fc507442470af31ab90357c2668ab0206cc86e42651920480e4e61674f17e3c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:48.057039Z","signature_b64":"frT3tKy2Dreo0cSkaH2JjjBHCS93rLzCZYe5L6xGsgx31VT/6v8iT76ZoFwVMquRXVzfOf9uXwyKY3uOrBlTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc507442470af31ab90357c2668ab0206cc86e42651920480e4e61674f17e3c2","last_reissued_at":"2026-07-05T08:38:48.056616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:48.056616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.01440","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-05T08:38:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F7jvqy083fjBKyGMLFA78tf0+eGxVeQWYVOvYqut1Sro/7fIhoFk/krr7Sqop6nNWjRgK1eJjwDWG9tCetCsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:30:38.784398Z"},"content_sha256":"bb30a6afe4921348858c86fd09661f2a156bc1a8a98ec77f9696e5cdb49e329c","schema_version":"1.0","event_id":"sha256:bb30a6afe4921348858c86fd09661f2a156bc1a8a98ec77f9696e5cdb49e329c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7RIHIQSHBLZRVOIDK7BGNCVQEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GAT-Steiner: Rectilinear Steiner Minimal Tree Prediction Using GNNs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bugra Onal, Eren Dogan, Matthew R. Guthaus, Muhammad Hadir Khan","submitted_at":"2024-07-01T16:32:49Z","abstract_excerpt":"The Rectilinear Steiner Minimum Tree (RSMT) problem is a fundamental problem in VLSI placement and routing and is known to be NP-hard. Traditional RSMT algorithms spend a significant amount of time on finding Steiner points to reduce the total wire length or use heuristics to approximate producing sub-optimal results. We show that Graph Neural Networks (GNNs) can be used to predict optimal Steiner points in RSMTs with high accuracy and can be parallelized on GPUs. In this paper, we propose GAT-Steiner, a graph attention network model that correctly predicts 99.846% of the nets in the ISPD19 be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01440","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/2407.01440/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-05T08:38:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nNdjbKXqw0YIBfCk5l/FSJnZ3vtzkfSbriPQpu/JHUuKM2JPY5cA+4BrewHPZpHrDzeIB1Esaiwzbjx8gnQODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:30:38.784893Z"},"content_sha256":"f9febe9721328a1820dc91ac4f5b4e1a22419027c9bb0e857add0859d2f6a319","schema_version":"1.0","event_id":"sha256:f9febe9721328a1820dc91ac4f5b4e1a22419027c9bb0e857add0859d2f6a319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB/bundle.json","state_url":"https://pith.science/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB/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-04T01:30:38Z","links":{"resolver":"https://pith.science/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB","bundle":"https://pith.science/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB/bundle.json","state":"https://pith.science/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RIHIQSHBLZRVOIDK7BGNCVQEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7RIHIQSHBLZRVOIDK7BGNCVQEB","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":"f9e2721d415db9b87fa9635796da46073070c85c73ad12b5200c18b108e249b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-01T16:32:49Z","title_canon_sha256":"5b9ce6a890d01546be7d19e8e0603c8ae4ead439e211851d381fd005d380f13f"},"schema_version":"1.0","source":{"id":"2407.01440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.01440","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"arxiv_version","alias_value":"2407.01440v1","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01440","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"pith_short_12","alias_value":"7RIHIQSHBLZR","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"pith_short_16","alias_value":"7RIHIQSHBLZRVOID","created_at":"2026-07-05T08:38:48Z"},{"alias_kind":"pith_short_8","alias_value":"7RIHIQSH","created_at":"2026-07-05T08:38:48Z"}],"graph_snapshots":[{"event_id":"sha256:f9febe9721328a1820dc91ac4f5b4e1a22419027c9bb0e857add0859d2f6a319","target":"graph","created_at":"2026-07-05T08:38:48Z","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/2407.01440/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Rectilinear Steiner Minimum Tree (RSMT) problem is a fundamental problem in VLSI placement and routing and is known to be NP-hard. Traditional RSMT algorithms spend a significant amount of time on finding Steiner points to reduce the total wire length or use heuristics to approximate producing sub-optimal results. We show that Graph Neural Networks (GNNs) can be used to predict optimal Steiner points in RSMTs with high accuracy and can be parallelized on GPUs. In this paper, we propose GAT-Steiner, a graph attention network model that correctly predicts 99.846% of the nets in the ISPD19 be","authors_text":"Bugra Onal, Eren Dogan, Matthew R. Guthaus, Muhammad Hadir Khan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-01T16:32:49Z","title":"GAT-Steiner: Rectilinear Steiner Minimal Tree Prediction Using GNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01440","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:bb30a6afe4921348858c86fd09661f2a156bc1a8a98ec77f9696e5cdb49e329c","target":"record","created_at":"2026-07-05T08:38:48Z","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":"f9e2721d415db9b87fa9635796da46073070c85c73ad12b5200c18b108e249b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-01T16:32:49Z","title_canon_sha256":"5b9ce6a890d01546be7d19e8e0603c8ae4ead439e211851d381fd005d380f13f"},"schema_version":"1.0","source":{"id":"2407.01440","kind":"arxiv","version":1}},"canonical_sha256":"fc507442470af31ab90357c2668ab0206cc86e42651920480e4e61674f17e3c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc507442470af31ab90357c2668ab0206cc86e42651920480e4e61674f17e3c2","first_computed_at":"2026-07-05T08:38:48.056616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:48.056616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"frT3tKy2Dreo0cSkaH2JjjBHCS93rLzCZYe5L6xGsgx31VT/6v8iT76ZoFwVMquRXVzfOf9uXwyKY3uOrBlTBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:48.057039Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.01440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb30a6afe4921348858c86fd09661f2a156bc1a8a98ec77f9696e5cdb49e329c","sha256:f9febe9721328a1820dc91ac4f5b4e1a22419027c9bb0e857add0859d2f6a319"],"state_sha256":"e608b15bce2a03a09cca12ee943d84f1a1050282ca359ddc9ff8d37977bb4a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnTv/am0W4lQuqZpJjxqT6b2x9e0E1ckmI7sVyrpagObiMNcIbiRQBhoKwPjfh87wNVJ5vFDAMvNLCESRaGnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:30:38.789837Z","bundle_sha256":"77cec5978448e4f809dbeeb25e8e6744443ea45c93d219ee41feaf3cf7dc043b"}}