{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MU5WVQ2ZQ2OQJTODR7OBEAJEDB","short_pith_number":"pith:MU5WVQ2Z","canonical_record":{"source":{"id":"1510.02197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-08T04:46:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"07f6fe9042bd4ec8092099506d8fada49ab158a31637d69e248c5027c9ae4641","abstract_canon_sha256":"4cecea45401246e37fb9903a2ecb6ec27ed90dabb619b339f2fac179a2365fa8"},"schema_version":"1.0"},"canonical_sha256":"653b6ac359869d04cdc38fdc120124184e82e71238df1974db023d3086520af0","source":{"kind":"arxiv","id":"1510.02197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02197","created_at":"2026-05-18T01:30:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02197v1","created_at":"2026-05-18T01:30:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02197","created_at":"2026-05-18T01:30:44Z"},{"alias_kind":"pith_short_12","alias_value":"MU5WVQ2ZQ2OQ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MU5WVQ2ZQ2OQJTOD","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MU5WVQ2Z","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MU5WVQ2ZQ2OQJTODR7OBEAJEDB","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-08T04:46:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"07f6fe9042bd4ec8092099506d8fada49ab158a31637d69e248c5027c9ae4641","abstract_canon_sha256":"4cecea45401246e37fb9903a2ecb6ec27ed90dabb619b339f2fac179a2365fa8"},"schema_version":"1.0"},"canonical_sha256":"653b6ac359869d04cdc38fdc120124184e82e71238df1974db023d3086520af0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:44.481093Z","signature_b64":"E9w+oCiDfqfGaf5v+q19RBQlurPBKRVI74ouJXiylWpNcweG49e1okClV4lPPkon3YW8D0djNHuK5045CmD7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"653b6ac359869d04cdc38fdc120124184e82e71238df1974db023d3086520af0","last_reissued_at":"2026-05-18T01:30:44.480604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:44.480604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02197","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-05-18T01:30:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5Nv/bVcZB774P55rhqM7qPvG/tDz9hlgxNLo/42eIPN6omg2Uw3IXCLZ9SvLItBUz0btXvztQs6cUtaf6SaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:22:10.217537Z"},"content_sha256":"baca4f1f39f4b94c4d22fdbae1fcca7b7b503767c9f7f776f9249486f69819e0","schema_version":"1.0","event_id":"sha256:baca4f1f39f4b94c4d22fdbae1fcca7b7b503767c9f7f776f9249486f69819e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MU5WVQ2ZQ2OQJTODR7OBEAJEDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of linearizable instances of the quadratic minimum spanning tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c","submitted_at":"2015-10-08T04:46:37Z","abstract_excerpt":"We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph $G=(V,E)$ that can be solved as a linear minimum spanning tree problem. Characterization of such problems on graphs with special properties are given. This include complete graphs, complete bipartite graphs, cactuses among others. Our characterization can be verified in $O(|E|^2)$ time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in $O(|E|)$ time. Related open problems are also indicated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02197","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":""},"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-18T01:30:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPmfIoWvapvEPSDi9F5OiSgOl0zBtjaRWIRGhrcwU68AXityd86xZ7kuNhS0W7dwThJ4nQPu35OMAbUlTvVaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:22:10.217891Z"},"content_sha256":"8d4053f53ac450dd1e8d782840366939b146e320ba8164fe145748aedb58ee9e","schema_version":"1.0","event_id":"sha256:8d4053f53ac450dd1e8d782840366939b146e320ba8164fe145748aedb58ee9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB/bundle.json","state_url":"https://pith.science/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB/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-05T10:22:10Z","links":{"resolver":"https://pith.science/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB","bundle":"https://pith.science/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB/bundle.json","state":"https://pith.science/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MU5WVQ2ZQ2OQJTODR7OBEAJEDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MU5WVQ2ZQ2OQJTODR7OBEAJEDB","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":"4cecea45401246e37fb9903a2ecb6ec27ed90dabb619b339f2fac179a2365fa8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-08T04:46:37Z","title_canon_sha256":"07f6fe9042bd4ec8092099506d8fada49ab158a31637d69e248c5027c9ae4641"},"schema_version":"1.0","source":{"id":"1510.02197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02197","created_at":"2026-05-18T01:30:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02197v1","created_at":"2026-05-18T01:30:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02197","created_at":"2026-05-18T01:30:44Z"},{"alias_kind":"pith_short_12","alias_value":"MU5WVQ2ZQ2OQ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MU5WVQ2ZQ2OQJTOD","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MU5WVQ2Z","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:8d4053f53ac450dd1e8d782840366939b146e320ba8164fe145748aedb58ee9e","target":"graph","created_at":"2026-05-18T01:30:44Z","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":"We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph $G=(V,E)$ that can be solved as a linear minimum spanning tree problem. Characterization of such problems on graphs with special properties are given. This include complete graphs, complete bipartite graphs, cactuses among others. Our characterization can be verified in $O(|E|^2)$ time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in $O(|E|)$ time. Related open problems are also indicated.","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-08T04:46:37Z","title":"A characterization of linearizable instances of the quadratic minimum spanning tree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02197","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:baca4f1f39f4b94c4d22fdbae1fcca7b7b503767c9f7f776f9249486f69819e0","target":"record","created_at":"2026-05-18T01:30:44Z","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":"4cecea45401246e37fb9903a2ecb6ec27ed90dabb619b339f2fac179a2365fa8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-08T04:46:37Z","title_canon_sha256":"07f6fe9042bd4ec8092099506d8fada49ab158a31637d69e248c5027c9ae4641"},"schema_version":"1.0","source":{"id":"1510.02197","kind":"arxiv","version":1}},"canonical_sha256":"653b6ac359869d04cdc38fdc120124184e82e71238df1974db023d3086520af0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"653b6ac359869d04cdc38fdc120124184e82e71238df1974db023d3086520af0","first_computed_at":"2026-05-18T01:30:44.480604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:44.480604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E9w+oCiDfqfGaf5v+q19RBQlurPBKRVI74ouJXiylWpNcweG49e1okClV4lPPkon3YW8D0djNHuK5045CmD7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:44.481093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baca4f1f39f4b94c4d22fdbae1fcca7b7b503767c9f7f776f9249486f69819e0","sha256:8d4053f53ac450dd1e8d782840366939b146e320ba8164fe145748aedb58ee9e"],"state_sha256":"665b0c0cc53e248f5335cadff0cb9ff195479ba4839c8ab051f88fb28a556cba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICjVvR463nT5aD5u0Uu78ho5x4K31aaFRNy0fBT6aJ5Am6O4miT5FT6Sf4pD+vHAZFfwMGPtvI8NeWj1nrrqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:22:10.220072Z","bundle_sha256":"c6956d37040a0a0d0fae97256c38e1582cc841fa38cdeef3dc03002ba502fdaf"}}