{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","short_pith_number":"pith:3J7QY3EP","canonical_record":{"source":{"id":"2608.00795","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3","abstract_canon_sha256":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e"},"schema_version":"1.0"},"canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","source":{"kind":"arxiv","id":"2608.00795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00795","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00795v1","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00795","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"3J7QY3EPRHVX","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_16","alias_value":"3J7QY3EPRHVXCZXU","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_8","alias_value":"3J7QY3EP","created_at":"2026-08-04T01:55:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","target":"record","payload":{"canonical_record":{"source":{"id":"2608.00795","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3","abstract_canon_sha256":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e"},"schema_version":"1.0"},"canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:09.724358Z","signature_b64":"DvKDsXrQ8hXso8P9zLgVD83BLSQXVF+SIYX8fP/a0Q/t+18tqXpwnlx2qWM1qNsQrpuKz4vjoCraKzWQXzl3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","last_reissued_at":"2026-08-04T01:55:09.722831Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:09.722831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.00795","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-08-04T01:55:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zcugcrTbBVchRfa/KN7UyT23pLFzga7maiFFQ/I0or76hdB5tISxdESKSAMTtCnFJFERLUkISxpzqA/OkVkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:36:18.740330Z"},"content_sha256":"44aa831da7c616b72a920a88ce1b27d9e1206876a786fc788f7b14757c309483","schema_version":"1.0","event_id":"sha256:44aa831da7c616b72a920a88ce1b27d9e1206876a786fc788f7b14757c309483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Algorithms for Minimum Steiner Point Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Donghoon Shin, Eungyu Woo","submitted_at":"2026-08-01T17:51:30Z","abstract_excerpt":"Given distinct terminals $P\\subset R^2$ and $R>0$, the Steiner tree problem with minimum number of Steiner points and bounded edge length asks for a straight line tree spanning $P$, with every edge of length at most $R$, that minimizes the number of Steiner points. Length is measured in a fixed $L_p$ metric with $p\\in Q_{\\ge 1}\\cup\\{\\infty\\}$. The optimum $k$ is not bounded by $n$, even in two-terminal case.\n  We give a deterministic exact algorithm that computes an optimal implicit representation in $n^{O(n)}$ time, independent of $k$, in the computation model of Section~\\ref{subseccomputatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00795","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.00795/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-08-04T01:55:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7taI8Ia/jGvbT3X6ReAGQzaKWOjsANWT1XvQ0uB5e1BNeTHZtQIeJ+ckl7YkfsUP/Ye3bq8L+GvDkBL5pgP7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:36:18.740966Z"},"content_sha256":"61b5eeb667c4c31892f3e8431812fb17681146ca6f228810d8593089ea87e7cb","schema_version":"1.0","event_id":"sha256:61b5eeb667c4c31892f3e8431812fb17681146ca6f228810d8593089ea87e7cb"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1023/a:1009842406728) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Rudelson, M., 2000. Distances between non-symmetric convex bodies and the𝑀𝑀∗-estimate. Positivity 4, 161–178. doi:10.1023/A: 1009842406728","arxiv_id":"2608.00795","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1023/a:","reconstructed_doi":"10.1023/a:1009842406728"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-05T00:28:47.184755Z","event_type":"pith.integrity.v1","detected_doi":"10.1023/a:1009842406728","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3e235900f777be5af3b85d09a158c9fca58399d2f26651040afe46943761a166","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17976,"payload_sha256":"d99a60925d7333cc1b80e6377dddec17642ecf925303e5720651f5db79bf87f5","signature_b64":"7Ldrf+ub+FkXynno/u5yYc/N8CmMnCTgIE3VN80blTojHjCE1OLiHdhpGEvyeNxBQ+fVuhBQvmXPMDowdTCYDQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T00:33:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1C6JullS5a2HbhaXAD7y/lFHigNpbHd59tLHVNiwhH0IzqMh4+Gtm7s8uAK4VBybZY9Kj1lk2A5BpZ7BcX4/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:36:18.749907Z"},"content_sha256":"01ed5076dd914444fac6710cdd5cdc7619337b3576c8203cb3f9ded59d0b3731","schema_version":"1.0","event_id":"sha256:01ed5076dd914444fac6710cdd5cdc7619337b3576c8203cb3f9ded59d0b3731"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/bundle.json","state_url":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/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-05T15:36:18Z","links":{"resolver":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH","bundle":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/bundle.json","state":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3"},"schema_version":"1.0","source":{"id":"2608.00795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00795","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00795v1","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00795","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"3J7QY3EPRHVX","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_16","alias_value":"3J7QY3EPRHVXCZXU","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_8","alias_value":"3J7QY3EP","created_at":"2026-08-04T01:55:09Z"}],"graph_snapshots":[{"event_id":"sha256:61b5eeb667c4c31892f3e8431812fb17681146ca6f228810d8593089ea87e7cb","target":"graph","created_at":"2026-08-04T01:55:09Z","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/2608.00795/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given distinct terminals $P\\subset R^2$ and $R>0$, the Steiner tree problem with minimum number of Steiner points and bounded edge length asks for a straight line tree spanning $P$, with every edge of length at most $R$, that minimizes the number of Steiner points. Length is measured in a fixed $L_p$ metric with $p\\in Q_{\\ge 1}\\cup\\{\\infty\\}$. The optimum $k$ is not bounded by $n$, even in two-terminal case.\n  We give a deterministic exact algorithm that computes an optimal implicit representation in $n^{O(n)}$ time, independent of $k$, in the computation model of Section~\\ref{subseccomputatio","authors_text":"Donghoon Shin, Eungyu Woo","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","title":"Exact Algorithms for Minimum Steiner Point Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00795","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:44aa831da7c616b72a920a88ce1b27d9e1206876a786fc788f7b14757c309483","target":"record","created_at":"2026-08-04T01:55:09Z","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":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3"},"schema_version":"1.0","source":{"id":"2608.00795","kind":"arxiv","version":1}},"canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","first_computed_at":"2026-08-04T01:55:09.722831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T01:55:09.722831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DvKDsXrQ8hXso8P9zLgVD83BLSQXVF+SIYX8fP/a0Q/t+18tqXpwnlx2qWM1qNsQrpuKz4vjoCraKzWQXzl3DQ==","signature_status":"signed_v1","signed_at":"2026-08-04T01:55:09.724358Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44aa831da7c616b72a920a88ce1b27d9e1206876a786fc788f7b14757c309483","sha256:61b5eeb667c4c31892f3e8431812fb17681146ca6f228810d8593089ea87e7cb","sha256:01ed5076dd914444fac6710cdd5cdc7619337b3576c8203cb3f9ded59d0b3731"],"state_sha256":"e809a35d3cd0f67f272f1655fdd6d770ae3249ea348c5b6df9c495abd291e4f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPcABhgEqksfQZ6qoGmEsOdX60F6DR4EjtoWY2JySYrfyK5ch7T2UOi69c3nsjQGu7SADsXTJyHTPp3vFKWGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T15:36:18.752254Z","bundle_sha256":"b6b0097d3f14ffc2b2be7c5b358f431db93eca0a8e8e6977892ca71c262a282a"}}