{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:I64WRTGVRQSDLRXCAR2FXJE4J2","short_pith_number":"pith:I64WRTGV","canonical_record":{"source":{"id":"2512.03594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-03T09:25:39Z","cross_cats_sorted":[],"title_canon_sha256":"a7233ad6bb0da2308880dea3e43b86b49a19545989e286bc776b35eb0cd5bdad","abstract_canon_sha256":"51696eef2a10577889a37312504de33e4f40e53e6aaefd231e6ce247d9565c46"},"schema_version":"1.0"},"canonical_sha256":"47b968ccd58c2435c6e204745ba49c4eb64484981c533d30fe9f115bf5e68a19","source":{"kind":"arxiv","id":"2512.03594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.03594","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2512.03594v2","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.03594","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"I64WRTGVRQSD","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"I64WRTGVRQSDLRXC","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"I64WRTGV","created_at":"2026-07-20T00:18:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:I64WRTGVRQSDLRXCAR2FXJE4J2","target":"record","payload":{"canonical_record":{"source":{"id":"2512.03594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-03T09:25:39Z","cross_cats_sorted":[],"title_canon_sha256":"a7233ad6bb0da2308880dea3e43b86b49a19545989e286bc776b35eb0cd5bdad","abstract_canon_sha256":"51696eef2a10577889a37312504de33e4f40e53e6aaefd231e6ce247d9565c46"},"schema_version":"1.0"},"canonical_sha256":"47b968ccd58c2435c6e204745ba49c4eb64484981c533d30fe9f115bf5e68a19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T00:18:16.396439Z","signature_b64":"ft/k7CSBSP82N6hJ6gcF00wR2oySsx+fQHaWBX5NcYkIDe+eQeDE+KGbVhgThi0soXy26rBpGai+72UOs9E7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47b968ccd58c2435c6e204745ba49c4eb64484981c533d30fe9f115bf5e68a19","last_reissued_at":"2026-07-20T00:18:16.395396Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T00:18:16.395396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.03594","source_version":2,"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-20T00:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quL2PxNZhfnrA+l88wRPStQeT00DAkN8QODswRhMT7bg5qX7lLLlHjJQ3iIot+2byvDIm8jBMKRudMYABKVdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:55:05.894186Z"},"content_sha256":"64d10f6eac6baaa2cc6c4f013ab76a2e9476005a9e017f83f87b5c4c77074acd","schema_version":"1.0","event_id":"sha256:64d10f6eac6baaa2cc6c4f013ab76a2e9476005a9e017f83f87b5c4c77074acd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:I64WRTGVRQSDLRXCAR2FXJE4J2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Detailed Routing Convergence through Offline Reinforcement Learning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Afsara Khan, Austin Rovinski","submitted_at":"2025-12-03T09:25:39Z","abstract_excerpt":"Detailed routing remains one of the most complex and time-consuming steps in modern physical design due to the challenges posed by shrinking feature sizes and stricter design rules. Prior detailed routers achieve state-of-the-art results by leveraging iterative pathfinding algorithms to route each net. However, runtimes are a major issue in detailed routers, as converging to a solution with zero design rule violations (DRVs) can be prohibitively expensive.\n  In this paper, we propose leveraging reinforcement learning (RL) to enable rapid convergence in detailed routing by learning from previou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.03594","kind":"arxiv","version":2},"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.03594/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-20T00:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0M4xOwZO0wQEBfJj5Wh4zGaPcGLohdI5vKEQaSzQemGCGiTjQui8nM3atsC8psp4mfLJknXq7arfGcB9pleCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:55:05.895323Z"},"content_sha256":"8c5d3fd57a8863decdcac4418c3cd51c40c6a205d0b597fb0cfc9db4b61ac5b0","schema_version":"1.0","event_id":"sha256:8c5d3fd57a8863decdcac4418c3cd51c40c6a205d0b597fb0cfc9db4b61ac5b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I64WRTGVRQSDLRXCAR2FXJE4J2/bundle.json","state_url":"https://pith.science/pith/I64WRTGVRQSDLRXCAR2FXJE4J2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I64WRTGVRQSDLRXCAR2FXJE4J2/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-07T18:55:05Z","links":{"resolver":"https://pith.science/pith/I64WRTGVRQSDLRXCAR2FXJE4J2","bundle":"https://pith.science/pith/I64WRTGVRQSDLRXCAR2FXJE4J2/bundle.json","state":"https://pith.science/pith/I64WRTGVRQSDLRXCAR2FXJE4J2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I64WRTGVRQSDLRXCAR2FXJE4J2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:I64WRTGVRQSDLRXCAR2FXJE4J2","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":"51696eef2a10577889a37312504de33e4f40e53e6aaefd231e6ce247d9565c46","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-03T09:25:39Z","title_canon_sha256":"a7233ad6bb0da2308880dea3e43b86b49a19545989e286bc776b35eb0cd5bdad"},"schema_version":"1.0","source":{"id":"2512.03594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.03594","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2512.03594v2","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.03594","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"I64WRTGVRQSD","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"I64WRTGVRQSDLRXC","created_at":"2026-07-20T00:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"I64WRTGV","created_at":"2026-07-20T00:18:16Z"}],"graph_snapshots":[{"event_id":"sha256:8c5d3fd57a8863decdcac4418c3cd51c40c6a205d0b597fb0cfc9db4b61ac5b0","target":"graph","created_at":"2026-07-20T00:18:16Z","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.03594/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Detailed routing remains one of the most complex and time-consuming steps in modern physical design due to the challenges posed by shrinking feature sizes and stricter design rules. Prior detailed routers achieve state-of-the-art results by leveraging iterative pathfinding algorithms to route each net. However, runtimes are a major issue in detailed routers, as converging to a solution with zero design rule violations (DRVs) can be prohibitively expensive.\n  In this paper, we propose leveraging reinforcement learning (RL) to enable rapid convergence in detailed routing by learning from previou","authors_text":"Afsara Khan, Austin Rovinski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-03T09:25:39Z","title":"Accelerating Detailed Routing Convergence through Offline Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.03594","kind":"arxiv","version":2},"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:64d10f6eac6baaa2cc6c4f013ab76a2e9476005a9e017f83f87b5c4c77074acd","target":"record","created_at":"2026-07-20T00:18:16Z","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":"51696eef2a10577889a37312504de33e4f40e53e6aaefd231e6ce247d9565c46","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2025-12-03T09:25:39Z","title_canon_sha256":"a7233ad6bb0da2308880dea3e43b86b49a19545989e286bc776b35eb0cd5bdad"},"schema_version":"1.0","source":{"id":"2512.03594","kind":"arxiv","version":2}},"canonical_sha256":"47b968ccd58c2435c6e204745ba49c4eb64484981c533d30fe9f115bf5e68a19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47b968ccd58c2435c6e204745ba49c4eb64484981c533d30fe9f115bf5e68a19","first_computed_at":"2026-07-20T00:18:16.395396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-20T00:18:16.395396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ft/k7CSBSP82N6hJ6gcF00wR2oySsx+fQHaWBX5NcYkIDe+eQeDE+KGbVhgThi0soXy26rBpGai+72UOs9E7Ag==","signature_status":"signed_v1","signed_at":"2026-07-20T00:18:16.396439Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.03594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64d10f6eac6baaa2cc6c4f013ab76a2e9476005a9e017f83f87b5c4c77074acd","sha256:8c5d3fd57a8863decdcac4418c3cd51c40c6a205d0b597fb0cfc9db4b61ac5b0"],"state_sha256":"0d009089ee199858f074464edcb2a2ccf23afeec7e3a3819c55d8cddfd563d61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JrYHL/91CfCK8/9PbhCMtl5A5SfpoO/W6D0zldfwndA/wopUmfo5AJUQKIYs7h/XQUVERKiS4bPFPin91036Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:55:05.902860Z","bundle_sha256":"f70d23707a09e286f8ad9697b31ebd2791fcd951feb6777dfd9d0c65f6f8f6fa"}}