{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RNGF7TFDS4EMWYIIX7K52RGSHN","short_pith_number":"pith:RNGF7TFD","canonical_record":{"source":{"id":"1401.0432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-02T13:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"ccd156f035bb20a21528ce64792c1045fd3d800e501c11fb589d816b7539c1bb","abstract_canon_sha256":"179db819adf8c07907af535161ebfebb827d0c4e9a0e521c0f74cf9514838202"},"schema_version":"1.0"},"canonical_sha256":"8b4c5fcca39708cb6108bfd5dd44d23b6044d4ced523338ea425f236f46c6523","source":{"kind":"arxiv","id":"1401.0432","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0432","created_at":"2026-05-18T02:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0432v2","created_at":"2026-05-18T02:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0432","created_at":"2026-05-18T02:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"RNGF7TFDS4EM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RNGF7TFDS4EMWYII","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RNGF7TFD","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RNGF7TFDS4EMWYIIX7K52RGSHN","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-02T13:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"ccd156f035bb20a21528ce64792c1045fd3d800e501c11fb589d816b7539c1bb","abstract_canon_sha256":"179db819adf8c07907af535161ebfebb827d0c4e9a0e521c0f74cf9514838202"},"schema_version":"1.0"},"canonical_sha256":"8b4c5fcca39708cb6108bfd5dd44d23b6044d4ced523338ea425f236f46c6523","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:20.975162Z","signature_b64":"t9znYQUfEa6JXkOcHgT57ZkBvKnLz0gjoY6xdL7pf5Q5apE6fvQhhRLh9ONcL8/07+XpsWmKvbuGRUeunakcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b4c5fcca39708cb6108bfd5dd44d23b6044d4ced523338ea425f236f46c6523","last_reissued_at":"2026-05-18T02:54:20.974725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:20.974725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0432","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:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZBVMQSCM8RcKHagJxiv98zGnFP7Bbm6G4OcRr8x8XBaEnPpPcSjMS2bXZExiJXqkym4KWmEwEsSLTIX4gjSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:51:55.191101Z"},"content_sha256":"f5db741b576078b80a7922cee97eda20bc5aaf98f41a6760e07e1b6ffa6adedf","schema_version":"1.0","event_id":"sha256:f5db741b576078b80a7922cee97eda20bc5aaf98f41a6760e07e1b6ffa6adedf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RNGF7TFDS4EMWYIIX7K52RGSHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimum Average Stretch Spanning Trees in Polygonal 2-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"G. Ramakrishna, N.S. Narayanaswamy","submitted_at":"2014-01-02T13:31:13Z","abstract_excerpt":"A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a super class of 2-connected outerplanar graphs. For a polygonal 2-tree on $n$ vertices, we present an algorithm to compute a minimum average stretch spanning tree in $O(n \\log n)$ time. This algorithm also finds a minimum fundamental cycle basis in polygonal 2-trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0432","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:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1d9ZmswRwXIynKYIrmbHAQ/BQJ8VngJCsI98l0vLdpG3MYCmh9YaVqvdopIt8eeFfvBVzbWkQYJFBlPQ20tMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:51:55.191754Z"},"content_sha256":"f3844292f7c86e4d2961a853ac480bdc8e5b668456f5e6f9b804153b9348e2f1","schema_version":"1.0","event_id":"sha256:f3844292f7c86e4d2961a853ac480bdc8e5b668456f5e6f9b804153b9348e2f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNGF7TFDS4EMWYIIX7K52RGSHN/bundle.json","state_url":"https://pith.science/pith/RNGF7TFDS4EMWYIIX7K52RGSHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNGF7TFDS4EMWYIIX7K52RGSHN/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:51:55Z","links":{"resolver":"https://pith.science/pith/RNGF7TFDS4EMWYIIX7K52RGSHN","bundle":"https://pith.science/pith/RNGF7TFDS4EMWYIIX7K52RGSHN/bundle.json","state":"https://pith.science/pith/RNGF7TFDS4EMWYIIX7K52RGSHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNGF7TFDS4EMWYIIX7K52RGSHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RNGF7TFDS4EMWYIIX7K52RGSHN","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":"179db819adf8c07907af535161ebfebb827d0c4e9a0e521c0f74cf9514838202","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-02T13:31:13Z","title_canon_sha256":"ccd156f035bb20a21528ce64792c1045fd3d800e501c11fb589d816b7539c1bb"},"schema_version":"1.0","source":{"id":"1401.0432","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0432","created_at":"2026-05-18T02:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0432v2","created_at":"2026-05-18T02:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0432","created_at":"2026-05-18T02:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"RNGF7TFDS4EM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RNGF7TFDS4EMWYII","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RNGF7TFD","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:f3844292f7c86e4d2961a853ac480bdc8e5b668456f5e6f9b804153b9348e2f1","target":"graph","created_at":"2026-05-18T02:54:20Z","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 spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a super class of 2-connected outerplanar graphs. For a polygonal 2-tree on $n$ vertices, we present an algorithm to compute a minimum average stretch spanning tree in $O(n \\log n)$ time. This algorithm also finds a minimum fundamental cycle basis in polygonal 2-trees.","authors_text":"G. Ramakrishna, N.S. Narayanaswamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-02T13:31:13Z","title":"On Minimum Average Stretch Spanning Trees in Polygonal 2-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0432","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:f5db741b576078b80a7922cee97eda20bc5aaf98f41a6760e07e1b6ffa6adedf","target":"record","created_at":"2026-05-18T02:54:20Z","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":"179db819adf8c07907af535161ebfebb827d0c4e9a0e521c0f74cf9514838202","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-02T13:31:13Z","title_canon_sha256":"ccd156f035bb20a21528ce64792c1045fd3d800e501c11fb589d816b7539c1bb"},"schema_version":"1.0","source":{"id":"1401.0432","kind":"arxiv","version":2}},"canonical_sha256":"8b4c5fcca39708cb6108bfd5dd44d23b6044d4ced523338ea425f236f46c6523","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b4c5fcca39708cb6108bfd5dd44d23b6044d4ced523338ea425f236f46c6523","first_computed_at":"2026-05-18T02:54:20.974725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:20.974725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9znYQUfEa6JXkOcHgT57ZkBvKnLz0gjoY6xdL7pf5Q5apE6fvQhhRLh9ONcL8/07+XpsWmKvbuGRUeunakcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:20.975162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0432","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5db741b576078b80a7922cee97eda20bc5aaf98f41a6760e07e1b6ffa6adedf","sha256:f3844292f7c86e4d2961a853ac480bdc8e5b668456f5e6f9b804153b9348e2f1"],"state_sha256":"385a71e6f14e4a5aa0bc4aa4fb5e4f729cf2dc7235620a71bff39154bb54f871"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWb/EJ+iPiEkGEstwpKAfNmheYqq6xoDy2FpGeURD+kywfFj2V3cSPQgCbgPz3rZu1fUKPsQC+ZK+ZxK2pe7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:51:55.195904Z","bundle_sha256":"31e1bb6ded3908bed3094fb8a8d455c296dfd984a659224c0a1c778fec5f6e63"}}