{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7I5XDHEONELWYV4KMML2ZXFEMA","short_pith_number":"pith:7I5XDHEO","canonical_record":{"source":{"id":"1811.05161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-11-13T08:32:48Z","cross_cats_sorted":[],"title_canon_sha256":"09bbbb287f31e1dc942e7256cdb746f51f631b1d22e2fc16a3c44c2c9e9d2732","abstract_canon_sha256":"46aac980c03cbd80bdf15ccd35e33b5099a2b76cec12110d35082fe386a5f833"},"schema_version":"1.0"},"canonical_sha256":"fa3b719c8e69176c578a6317acdca4602bd66866640e6dfa1aae8c00fdd70786","source":{"kind":"arxiv","id":"1811.05161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05161","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05161v1","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05161","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"7I5XDHEONELW","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7I5XDHEONELWYV4K","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7I5XDHEO","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7I5XDHEONELWYV4KMML2ZXFEMA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-11-13T08:32:48Z","cross_cats_sorted":[],"title_canon_sha256":"09bbbb287f31e1dc942e7256cdb746f51f631b1d22e2fc16a3c44c2c9e9d2732","abstract_canon_sha256":"46aac980c03cbd80bdf15ccd35e33b5099a2b76cec12110d35082fe386a5f833"},"schema_version":"1.0"},"canonical_sha256":"fa3b719c8e69176c578a6317acdca4602bd66866640e6dfa1aae8c00fdd70786","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.750339Z","signature_b64":"7A5Q7zUGGUOl/7n1WBbGzjwgQsUushG4WKjc2DAKSflbUVm3AwdXJ+qx5VPbKwPzeNWpj53pn5LIX9yeFDE/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3b719c8e69176c578a6317acdca4602bd66866640e6dfa1aae8c00fdd70786","last_reissued_at":"2026-05-18T00:00:46.749944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.749944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05161","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-05-18T00:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHw9/ZYjnPpKSBeLOBQfimZTL3wgQMKBCGIYw5UPo/UDRwUUJO6JNVv2Blp0CVCd6GDhLkRXdOR9IpLTGGG7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:06:34.658906Z"},"content_sha256":"2ff5a1b95095a8486160fdf210eb010ac15b06bb8436edb289260fbfffacbcfa","schema_version":"1.0","event_id":"sha256:2ff5a1b95095a8486160fdf210eb010ac15b06bb8436edb289260fbfffacbcfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7I5XDHEONELWYV4KMML2ZXFEMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring the Scope of Unconstrained Via Minimization by Recursive Floorplan Bipartitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Bapi Kar, Chittaranjan Mandal, Susmita Sur-Kolay","submitted_at":"2018-11-13T08:32:48Z","abstract_excerpt":"Random via failure is a major concern for post-fabrication reliability and poor manufacturing yield. A demanding solution to this problem is redundant via insertion during post-routing optimization. It becomes very critical when a multi-layer routing solution already incurs a large number of vias. Very few global routers addressed unconstrained via minimization (UVM) problem, while using minimal pattern routing and layer assignment of nets. It also includes a recent floorplan based early global routability assessment tool STAIRoute \\cite{karb2}.\n  This work addresses an early version of uncons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05161","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":""},"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:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+NHuHTN6gE3OU/wljAfCkHT9K8H72zjD4B+PC8K4UWtB0mUci0J9WGRxhjFF6NdPj6pAwOAEu2t9eB4LNCiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:06:34.659610Z"},"content_sha256":"24d5e567265f8cfe0dd611b6078baa1372337ec95fc0a74c3f0ea669bd2cdf3d","schema_version":"1.0","event_id":"sha256:24d5e567265f8cfe0dd611b6078baa1372337ec95fc0a74c3f0ea669bd2cdf3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I5XDHEONELWYV4KMML2ZXFEMA/bundle.json","state_url":"https://pith.science/pith/7I5XDHEONELWYV4KMML2ZXFEMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I5XDHEONELWYV4KMML2ZXFEMA/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-10T00:06:34Z","links":{"resolver":"https://pith.science/pith/7I5XDHEONELWYV4KMML2ZXFEMA","bundle":"https://pith.science/pith/7I5XDHEONELWYV4KMML2ZXFEMA/bundle.json","state":"https://pith.science/pith/7I5XDHEONELWYV4KMML2ZXFEMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I5XDHEONELWYV4KMML2ZXFEMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7I5XDHEONELWYV4KMML2ZXFEMA","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":"46aac980c03cbd80bdf15ccd35e33b5099a2b76cec12110d35082fe386a5f833","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-11-13T08:32:48Z","title_canon_sha256":"09bbbb287f31e1dc942e7256cdb746f51f631b1d22e2fc16a3c44c2c9e9d2732"},"schema_version":"1.0","source":{"id":"1811.05161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05161","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05161v1","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05161","created_at":"2026-05-18T00:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"7I5XDHEONELW","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7I5XDHEONELWYV4K","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7I5XDHEO","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:24d5e567265f8cfe0dd611b6078baa1372337ec95fc0a74c3f0ea669bd2cdf3d","target":"graph","created_at":"2026-05-18T00:00:46Z","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":"Random via failure is a major concern for post-fabrication reliability and poor manufacturing yield. A demanding solution to this problem is redundant via insertion during post-routing optimization. It becomes very critical when a multi-layer routing solution already incurs a large number of vias. Very few global routers addressed unconstrained via minimization (UVM) problem, while using minimal pattern routing and layer assignment of nets. It also includes a recent floorplan based early global routability assessment tool STAIRoute \\cite{karb2}.\n  This work addresses an early version of uncons","authors_text":"Bapi Kar, Chittaranjan Mandal, Susmita Sur-Kolay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-11-13T08:32:48Z","title":"Exploring the Scope of Unconstrained Via Minimization by Recursive Floorplan Bipartitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05161","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:2ff5a1b95095a8486160fdf210eb010ac15b06bb8436edb289260fbfffacbcfa","target":"record","created_at":"2026-05-18T00:00:46Z","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":"46aac980c03cbd80bdf15ccd35e33b5099a2b76cec12110d35082fe386a5f833","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2018-11-13T08:32:48Z","title_canon_sha256":"09bbbb287f31e1dc942e7256cdb746f51f631b1d22e2fc16a3c44c2c9e9d2732"},"schema_version":"1.0","source":{"id":"1811.05161","kind":"arxiv","version":1}},"canonical_sha256":"fa3b719c8e69176c578a6317acdca4602bd66866640e6dfa1aae8c00fdd70786","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3b719c8e69176c578a6317acdca4602bd66866640e6dfa1aae8c00fdd70786","first_computed_at":"2026-05-18T00:00:46.749944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:46.749944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7A5Q7zUGGUOl/7n1WBbGzjwgQsUushG4WKjc2DAKSflbUVm3AwdXJ+qx5VPbKwPzeNWpj53pn5LIX9yeFDE/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:46.750339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ff5a1b95095a8486160fdf210eb010ac15b06bb8436edb289260fbfffacbcfa","sha256:24d5e567265f8cfe0dd611b6078baa1372337ec95fc0a74c3f0ea669bd2cdf3d"],"state_sha256":"5ae1b05f1215d546a68e47d5bea7a0c06498823b3f8d5e29a17e3d14f944940d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLKzz1Qsc9DwIlAuODeqo/24exNSOQ7Q02aOqfxqZmMmQ0aa11hxt/eoYf5XyibmgGy9zVzPDrYRoxccQDDHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:06:34.663077Z","bundle_sha256":"5fdf746f33028c2ace639327509dd3146073e90a317dc719610924e3016a529c"}}