{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4K2QCV4GAI5FSG6W26G4OG5QI4","short_pith_number":"pith:4K2QCV4G","schema_version":"1.0","canonical_sha256":"e2b5015786023a591bd6d78dc71bb04708558e86f40572ad73a7586b4e1e4832","source":{"kind":"arxiv","id":"1501.00933","version":2},"attestation_state":"computed","paper":{"title":"Two-Level Rectilinear Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nicolas K\\\"ammerling, Stephan Held","submitted_at":"2015-01-05T17:39:34Z","abstract_excerpt":"Given a set $P$ of terminals in the plane and a partition of $P$ into $k$ subsets $P_1, ..., P_k$, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree $T_i$ connecting the terminals in each set $P_i$ ($i=1,...,k$) and a top-level tree $T_{top}$ connecting the trees $T_1, ..., T_k$. The goal is to minimize the total length of all trees. This problem arises naturally in the design of low-power physical implementations of parity functions on a computer chip.\n  For bounded $k$ we present a polynomial time approximation scheme (PTAS) that is based on Arora's PTAS for rectili"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.00933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-05T17:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"aee8ab5ec2afabb4e15ce481d2b43b3310d49bcfbe01ec1965d27a4aa9cbc7e0","abstract_canon_sha256":"ba66e8380125c71a7df48e3d84101434eecc635b4e469e33c2513d412698f26d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.874497Z","signature_b64":"8xtr8kfeRptyOFKPJHAof/gzsXhxD/fnRcWgVye3fo6dW9C67ZEgg6rFRmkrkMe4Ac4pCKdf4dqTBVKJhc83Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2b5015786023a591bd6d78dc71bb04708558e86f40572ad73a7586b4e1e4832","last_reissued_at":"2026-05-18T02:19:07.873846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.873846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Level Rectilinear Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nicolas K\\\"ammerling, Stephan Held","submitted_at":"2015-01-05T17:39:34Z","abstract_excerpt":"Given a set $P$ of terminals in the plane and a partition of $P$ into $k$ subsets $P_1, ..., P_k$, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree $T_i$ connecting the terminals in each set $P_i$ ($i=1,...,k$) and a top-level tree $T_{top}$ connecting the trees $T_1, ..., T_k$. The goal is to minimize the total length of all trees. This problem arises naturally in the design of low-power physical implementations of parity functions on a computer chip.\n  For bounded $k$ we present a polynomial time approximation scheme (PTAS) that is based on Arora's PTAS for rectili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00933","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00933","created_at":"2026-05-18T02:19:07.873938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00933v2","created_at":"2026-05-18T02:19:07.873938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00933","created_at":"2026-05-18T02:19:07.873938+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K2QCV4GAI5F","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K2QCV4GAI5FSG6W","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K2QCV4G","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4","json":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4.json","graph_json":"https://pith.science/api/pith-number/4K2QCV4GAI5FSG6W26G4OG5QI4/graph.json","events_json":"https://pith.science/api/pith-number/4K2QCV4GAI5FSG6W26G4OG5QI4/events.json","paper":"https://pith.science/paper/4K2QCV4G"},"agent_actions":{"view_html":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4","download_json":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4.json","view_paper":"https://pith.science/paper/4K2QCV4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00933&json=true","fetch_graph":"https://pith.science/api/pith-number/4K2QCV4GAI5FSG6W26G4OG5QI4/graph.json","fetch_events":"https://pith.science/api/pith-number/4K2QCV4GAI5FSG6W26G4OG5QI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/action/storage_attestation","attest_author":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/action/author_attestation","sign_citation":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/action/citation_signature","submit_replication":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/action/replication_record"}},"created_at":"2026-05-18T02:19:07.873938+00:00","updated_at":"2026-05-18T02:19:07.873938+00:00"}