{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X2DZEG5CJCEHCDZIPI7FB6FXEJ","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":"3d85d67dbcd24b7192952fb5dafe5f96debd85d25db7f7dfa5cb1a2ad9ec83b3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-30T07:45:35Z","title_canon_sha256":"89b4a0edb05ac79ab7ab06cf35111e3b77ac15534d3bd14c7b5633e5b930d86d"},"schema_version":"1.0","source":{"id":"1210.7919","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7919","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7919v3","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7919","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"X2DZEG5CJCEH","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X2DZEG5CJCEHCDZI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X2DZEG5C","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:73d8a68f434b6537684c7731d4e7dcf577527c55cfb2310da6795eb00f26d251","target":"graph","created_at":"2026-05-18T03:10:24Z","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":"A tree t-spanner of an unweighted graph G is a spanning tree T such that for every two vertices their distance in T is at most t times their distance in G. Given an unweighted graph G and a positive integer t as input, the tree t-spanner problem is to compute a tree t-spanner of G if one exists. This decision problem is known to be NP-complete even in the restricted class of unweighted planar graphs. We present a linear-time reduction from tree t-spanner in outerplanar graphs to the supply-demand tree partition problem. Based on this reduction, we obtain a linear-time algorithm to solve tree t","authors_text":"G. Ramakrishna, N.S. Narayanaswamy","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-30T07:45:35Z","title":"Tree t-spanners in Outerplanar Graphs via Supply Demand Partition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7919","kind":"arxiv","version":3},"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:afcb4beaee0d8a7463410ffebaa89aafdb0293e186fb5ad5899378441167e54c","target":"record","created_at":"2026-05-18T03:10:24Z","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":"3d85d67dbcd24b7192952fb5dafe5f96debd85d25db7f7dfa5cb1a2ad9ec83b3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-30T07:45:35Z","title_canon_sha256":"89b4a0edb05ac79ab7ab06cf35111e3b77ac15534d3bd14c7b5633e5b930d86d"},"schema_version":"1.0","source":{"id":"1210.7919","kind":"arxiv","version":3}},"canonical_sha256":"be87921ba24888710f287a3e50f8b7225673008e716fb3ab540df500501efab0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be87921ba24888710f287a3e50f8b7225673008e716fb3ab540df500501efab0","first_computed_at":"2026-05-18T03:10:24.364233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:24.364233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HA+U1vqgyT1PAIBMvMXmKbs2AvwAS1vn62mjNDQ0CFC5S29uoOj3r1OZ6dHa6zj3hJzFYQKHrJfmCtrTppirAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:24.364954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7919","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afcb4beaee0d8a7463410ffebaa89aafdb0293e186fb5ad5899378441167e54c","sha256:73d8a68f434b6537684c7731d4e7dcf577527c55cfb2310da6795eb00f26d251"],"state_sha256":"fa8e5bd42266191c37fa915898b1ce16d2f2148662fcbec71eb59ba19031ae5c"}