{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BA252YUVQIZRYVRJMDHUB7OO47","short_pith_number":"pith:BA252YUV","canonical_record":{"source":{"id":"1803.03885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T02:41:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"62c60d9cf8c26a00e3ff58687d3d54db39d41f17856d582472848d092b277bf3","abstract_canon_sha256":"5e87cd3df980f4a2c83e5db77a49dc96decd5abe08ab9c75e8d90f17b77aa658"},"schema_version":"1.0"},"canonical_sha256":"0835dd629582331c562960cf40fdcee7e2828a4cdf4588b200907d4801d0ed37","source":{"kind":"arxiv","id":"1803.03885","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03885","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03885v2","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03885","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"BA252YUVQIZR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BA252YUVQIZRYVRJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BA252YUV","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BA252YUVQIZRYVRJMDHUB7OO47","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T02:41:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"62c60d9cf8c26a00e3ff58687d3d54db39d41f17856d582472848d092b277bf3","abstract_canon_sha256":"5e87cd3df980f4a2c83e5db77a49dc96decd5abe08ab9c75e8d90f17b77aa658"},"schema_version":"1.0"},"canonical_sha256":"0835dd629582331c562960cf40fdcee7e2828a4cdf4588b200907d4801d0ed37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:49.854617Z","signature_b64":"SKFvGGFOuSH12U9AdrnmsxKTjconlRnXoXVgf77Q0zUcECLU1JikBBcAD7Bg0WkXU+H9Kqlouz4wAtQmBUWcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0835dd629582331c562960cf40fdcee7e2828a4cdf4588b200907d4801d0ed37","last_reissued_at":"2026-05-18T00:07:49.853898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:49.853898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03885","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-05-18T00:07:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMRwaw29P8Wr3aSBqsTjL49CvK6TOLxnfrIhx8b1knqOEL0ranZxoco6T8cQtI3SQ8hHhD04g3iQ0AKbqmvbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:27.409533Z"},"content_sha256":"c97d04d8eb7bc9af9e586c1fdb91995489357fd2d413eb417dfeeffef981823a","schema_version":"1.0","event_id":"sha256:c97d04d8eb7bc9af9e586c1fdb91995489357fd2d413eb417dfeeffef981823a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BA252YUVQIZRYVRJMDHUB7OO47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel FPGA Router using Sub-Gradient method and Steiner tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Akash Kumar, Chin Hao Hoo, Kapil Ahuja, Rohit Agrawal","submitted_at":"2018-03-11T02:41:06Z","abstract_excerpt":"In the FPGA (Field Programmable Gate Arrays) design flow, one of the most time-consuming step is the routing of nets. Therefore, there is a need to accelerate it. In a recent paper by Hoo et. al., the authors have developed a Linear Programming based framework that parallelizes this routing process to achieve significant speedups (the algorithm is termed as ParaLaR). However, this approach has certain weaknesses. Namely, the constraints violation by the solution and a local minima that could be improved. We address these two issues here.\n  In our paper, we use this framework and solve it using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03885","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":""},"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-18T00:07:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5XiZZ3L59LGnq49KdUoxHfflcPTwzv3oy0+LjEonNvunslA9lqPlCgnAK8RWw1OVIANUxP3u7YvSmbzwDCBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:27.410386Z"},"content_sha256":"d85670607e361b09d9385d8d8efa9cceb7640a089fabf77d2308a6a32eb34faf","schema_version":"1.0","event_id":"sha256:d85670607e361b09d9385d8d8efa9cceb7640a089fabf77d2308a6a32eb34faf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BA252YUVQIZRYVRJMDHUB7OO47/bundle.json","state_url":"https://pith.science/pith/BA252YUVQIZRYVRJMDHUB7OO47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BA252YUVQIZRYVRJMDHUB7OO47/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-05-31T02:56:27Z","links":{"resolver":"https://pith.science/pith/BA252YUVQIZRYVRJMDHUB7OO47","bundle":"https://pith.science/pith/BA252YUVQIZRYVRJMDHUB7OO47/bundle.json","state":"https://pith.science/pith/BA252YUVQIZRYVRJMDHUB7OO47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BA252YUVQIZRYVRJMDHUB7OO47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BA252YUVQIZRYVRJMDHUB7OO47","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":"5e87cd3df980f4a2c83e5db77a49dc96decd5abe08ab9c75e8d90f17b77aa658","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T02:41:06Z","title_canon_sha256":"62c60d9cf8c26a00e3ff58687d3d54db39d41f17856d582472848d092b277bf3"},"schema_version":"1.0","source":{"id":"1803.03885","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03885","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03885v2","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03885","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"BA252YUVQIZR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BA252YUVQIZRYVRJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BA252YUV","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:d85670607e361b09d9385d8d8efa9cceb7640a089fabf77d2308a6a32eb34faf","target":"graph","created_at":"2026-05-18T00:07:49Z","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"},"paper":{"abstract_excerpt":"In the FPGA (Field Programmable Gate Arrays) design flow, one of the most time-consuming step is the routing of nets. Therefore, there is a need to accelerate it. In a recent paper by Hoo et. al., the authors have developed a Linear Programming based framework that parallelizes this routing process to achieve significant speedups (the algorithm is termed as ParaLaR). However, this approach has certain weaknesses. Namely, the constraints violation by the solution and a local minima that could be improved. We address these two issues here.\n  In our paper, we use this framework and solve it using","authors_text":"Akash Kumar, Chin Hao Hoo, Kapil Ahuja, Rohit Agrawal","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T02:41:06Z","title":"Parallel FPGA Router using Sub-Gradient method and Steiner tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03885","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:c97d04d8eb7bc9af9e586c1fdb91995489357fd2d413eb417dfeeffef981823a","target":"record","created_at":"2026-05-18T00:07:49Z","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":"5e87cd3df980f4a2c83e5db77a49dc96decd5abe08ab9c75e8d90f17b77aa658","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-11T02:41:06Z","title_canon_sha256":"62c60d9cf8c26a00e3ff58687d3d54db39d41f17856d582472848d092b277bf3"},"schema_version":"1.0","source":{"id":"1803.03885","kind":"arxiv","version":2}},"canonical_sha256":"0835dd629582331c562960cf40fdcee7e2828a4cdf4588b200907d4801d0ed37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0835dd629582331c562960cf40fdcee7e2828a4cdf4588b200907d4801d0ed37","first_computed_at":"2026-05-18T00:07:49.853898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:49.853898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKFvGGFOuSH12U9AdrnmsxKTjconlRnXoXVgf77Q0zUcECLU1JikBBcAD7Bg0WkXU+H9Kqlouz4wAtQmBUWcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:49.854617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03885","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c97d04d8eb7bc9af9e586c1fdb91995489357fd2d413eb417dfeeffef981823a","sha256:d85670607e361b09d9385d8d8efa9cceb7640a089fabf77d2308a6a32eb34faf"],"state_sha256":"ea66ad7f470fbeb4ae655092473024adc8ccbc7b315853712a52be153aca7042"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRU3wzsbMSSEgUWRbbUnZea5ah9rgX1sMENkGqSiiQOaIg8z9L87dyLUjVdIWW3I5ieGCo5ItmBAeGAmkGuQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:56:27.414136Z","bundle_sha256":"80579366cdf9fb190c09decb337b75a9dc89f1d1d6fce5a26f8b467d1da15588"}}