{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4K2QCV4GAI5FSG6W26G4OG5QI4","short_pith_number":"pith:4K2QCV4G","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"},"canonical_sha256":"e2b5015786023a591bd6d78dc71bb04708558e86f40572ad73a7586b4e1e4832","source":{"kind":"arxiv","id":"1501.00933","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00933","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00933v2","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00933","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"4K2QCV4GAI5F","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4K2QCV4GAI5FSG6W","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4K2QCV4G","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4K2QCV4GAI5FSG6W26G4OG5QI4","target":"record","payload":{"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"},"canonical_sha256":"e2b5015786023a591bd6d78dc71bb04708558e86f40572ad73a7586b4e1e4832","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"},"source_kind":"arxiv","source_id":"1501.00933","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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gp6nAeoC8Zn34gpzESEqj15grohtMiJyFTAjeetXr6pw/4Dz4zR/s/DKNZo729k/kQFbFG113Ymger3BkBGBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:51:36.678057Z"},"content_sha256":"9c021e7a229c5cbda8cc442e43af2e03a1687cae0734c972bfcf9b11db38b828","schema_version":"1.0","event_id":"sha256:9c021e7a229c5cbda8cc442e43af2e03a1687cae0734c972bfcf9b11db38b828"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4K2QCV4GAI5FSG6W26G4OG5QI4","target":"graph","payload":{"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"},"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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eChAzfigAoKrLeKKb5QJ+GFrYQE0HktOJPuH/UIK2o4e5zj1D+qwy59zBK0NV4NoOeVeaNZy5xyEOvLWtDLgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:51:36.678700Z"},"content_sha256":"0a86521a03f349b9dff5afb83231343bcc79ca8e0b589e5cbeba96e46064516b","schema_version":"1.0","event_id":"sha256:0a86521a03f349b9dff5afb83231343bcc79ca8e0b589e5cbeba96e46064516b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/bundle.json","state_url":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/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-27T07:51:36Z","links":{"resolver":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4","bundle":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/bundle.json","state":"https://pith.science/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4K2QCV4GAI5FSG6W26G4OG5QI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4K2QCV4GAI5FSG6W26G4OG5QI4","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":"ba66e8380125c71a7df48e3d84101434eecc635b4e469e33c2513d412698f26d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-05T17:39:34Z","title_canon_sha256":"aee8ab5ec2afabb4e15ce481d2b43b3310d49bcfbe01ec1965d27a4aa9cbc7e0"},"schema_version":"1.0","source":{"id":"1501.00933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00933","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00933v2","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00933","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"4K2QCV4GAI5F","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4K2QCV4GAI5FSG6W","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4K2QCV4G","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:0a86521a03f349b9dff5afb83231343bcc79ca8e0b589e5cbeba96e46064516b","target":"graph","created_at":"2026-05-18T02:19:07Z","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":"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","authors_text":"Nicolas K\\\"ammerling, Stephan Held","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-05T17:39:34Z","title":"Two-Level Rectilinear Steiner Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00933","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:9c021e7a229c5cbda8cc442e43af2e03a1687cae0734c972bfcf9b11db38b828","target":"record","created_at":"2026-05-18T02:19:07Z","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":"ba66e8380125c71a7df48e3d84101434eecc635b4e469e33c2513d412698f26d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-05T17:39:34Z","title_canon_sha256":"aee8ab5ec2afabb4e15ce481d2b43b3310d49bcfbe01ec1965d27a4aa9cbc7e0"},"schema_version":"1.0","source":{"id":"1501.00933","kind":"arxiv","version":2}},"canonical_sha256":"e2b5015786023a591bd6d78dc71bb04708558e86f40572ad73a7586b4e1e4832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2b5015786023a591bd6d78dc71bb04708558e86f40572ad73a7586b4e1e4832","first_computed_at":"2026-05-18T02:19:07.873846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:07.873846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8xtr8kfeRptyOFKPJHAof/gzsXhxD/fnRcWgVye3fo6dW9C67ZEgg6rFRmkrkMe4Ac4pCKdf4dqTBVKJhc83Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:07.874497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c021e7a229c5cbda8cc442e43af2e03a1687cae0734c972bfcf9b11db38b828","sha256:0a86521a03f349b9dff5afb83231343bcc79ca8e0b589e5cbeba96e46064516b"],"state_sha256":"d33a6a9ee2e91a493387712f859290a6c61be0a6b41718b86dc7eb16eaebc615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAQVIpAfd+GGtyl8Dli+bNcHBUN7t4Gns9CYtRahvj7nKMJYnqhP1h5tHs3bRqT9qgHQ00ED0j55EyU+kBVZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:51:36.682560Z","bundle_sha256":"786084ae2c1101b29cac310ca400f0cbd7caa578feb68bbd1c9cbb3125cd011f"}}