{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X2DZEG5CJCEHCDZIPI7FB6FXEJ","short_pith_number":"pith:X2DZEG5C","canonical_record":{"source":{"id":"1210.7919","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-30T07:45:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"89b4a0edb05ac79ab7ab06cf35111e3b77ac15534d3bd14c7b5633e5b930d86d","abstract_canon_sha256":"3d85d67dbcd24b7192952fb5dafe5f96debd85d25db7f7dfa5cb1a2ad9ec83b3"},"schema_version":"1.0"},"canonical_sha256":"be87921ba24888710f287a3e50f8b7225673008e716fb3ab540df500501efab0","source":{"kind":"arxiv","id":"1210.7919","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X2DZEG5CJCEHCDZIPI7FB6FXEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7919","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-30T07:45:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"89b4a0edb05ac79ab7ab06cf35111e3b77ac15534d3bd14c7b5633e5b930d86d","abstract_canon_sha256":"3d85d67dbcd24b7192952fb5dafe5f96debd85d25db7f7dfa5cb1a2ad9ec83b3"},"schema_version":"1.0"},"canonical_sha256":"be87921ba24888710f287a3e50f8b7225673008e716fb3ab540df500501efab0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.364954Z","signature_b64":"HA+U1vqgyT1PAIBMvMXmKbs2AvwAS1vn62mjNDQ0CFC5S29uoOj3r1OZ6dHa6zj3hJzFYQKHrJfmCtrTppirAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be87921ba24888710f287a3e50f8b7225673008e716fb3ab540df500501efab0","last_reissued_at":"2026-05-18T03:10:24.364233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.364233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7919","source_version":3,"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-18T03:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkqh8c1uHkpTeYjKwFbPzfd7CuWjP5HjH9p4CC+N92FOAFcv3ic7H8GFLx4G9mJzavOmKdWrai38Xnv00JaUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:39:07.177078Z"},"content_sha256":"afcb4beaee0d8a7463410ffebaa89aafdb0293e186fb5ad5899378441167e54c","schema_version":"1.0","event_id":"sha256:afcb4beaee0d8a7463410ffebaa89aafdb0293e186fb5ad5899378441167e54c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X2DZEG5CJCEHCDZIPI7FB6FXEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree t-spanners in Outerplanar Graphs via Supply Demand Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"G. Ramakrishna, N.S. Narayanaswamy","submitted_at":"2012-10-30T07:45:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7919","kind":"arxiv","version":3},"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-18T03:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxZUFYgriQvLjJx8nQtUR2M+zk0WK4rBl/KWX8uQLeZP9dqWLiPnFRkL+egshqPueVJD9LzwPysJyD4p4+rkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:39:07.177825Z"},"content_sha256":"73d8a68f434b6537684c7731d4e7dcf577527c55cfb2310da6795eb00f26d251","schema_version":"1.0","event_id":"sha256:73d8a68f434b6537684c7731d4e7dcf577527c55cfb2310da6795eb00f26d251"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ/bundle.json","state_url":"https://pith.science/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ/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-09T08:39:07Z","links":{"resolver":"https://pith.science/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ","bundle":"https://pith.science/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ/bundle.json","state":"https://pith.science/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2DZEG5CJCEHCDZIPI7FB6FXEJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHb3UMTAt/T5rG26WsJkapnUoXOcY+V8xf/qePwVgtbdBbDRLxzeKNsffpJ+35A+CtdA2WLTYqVyD8bCN2TrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:39:07.180444Z","bundle_sha256":"0bf48b30c63ccd24d6c9d5aabfeb6861e9a041845445c13d5ea59b9729626e49"}}