{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6Z6GB65TCI2MT5OHQUG4KQ3Y47","short_pith_number":"pith:6Z6GB65T","canonical_record":{"source":{"id":"1603.04451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T20:04:32Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"a68a8bbb0955a6a2110cea56d61472b245052385af1e824a12ebee7d2944b03f","abstract_canon_sha256":"dec988d277d8aa348ec731fe54b7e03ce4569851389dd81f86a38d684823179c"},"schema_version":"1.0"},"canonical_sha256":"f67c60fbb31234c9f5c7850dc54378e7c6c953594b26967cfb98dea07eacada9","source":{"kind":"arxiv","id":"1603.04451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04451","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04451v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04451","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"6Z6GB65TCI2M","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6Z6GB65TCI2MT5OH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6Z6GB65T","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6Z6GB65TCI2MT5OHQUG4KQ3Y47","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T20:04:32Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"a68a8bbb0955a6a2110cea56d61472b245052385af1e824a12ebee7d2944b03f","abstract_canon_sha256":"dec988d277d8aa348ec731fe54b7e03ce4569851389dd81f86a38d684823179c"},"schema_version":"1.0"},"canonical_sha256":"f67c60fbb31234c9f5c7850dc54378e7c6c953594b26967cfb98dea07eacada9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.905789Z","signature_b64":"vvj28qr3e81HMSRbE/DaOEkNDctkuHaTd2KLUS0nWCfWr3V5eJjHcvLk3Om5GLGX/l22YwKwGpZMuC+MS5DOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67c60fbb31234c9f5c7850dc54378e7c6c953594b26967cfb98dea07eacada9","last_reissued_at":"2026-05-18T01:19:04.905306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.905306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04451","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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lONBZHIfx2o7I2vTZlkxmpSs4Qu/kE52re+cVCTzT1wIfj/qDQNy8roYkThUlXjKpTag+19JE2ZgU9e8P4WPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:45:50.669060Z"},"content_sha256":"a9b123125ce4a0a95c9ef3b2e062f58c18ba245ec32f3e6281178b3f2d8913bc","schema_version":"1.0","event_id":"sha256:a9b123125ce4a0a95c9ef3b2e062f58c18ba245ec32f3e6281178b3f2d8913bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6Z6GB65TCI2MT5OHQUG4KQ3Y47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Quadratic Minimum Spanning Tree Problem and its Variations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c, Ruonan Zhang","submitted_at":"2016-03-14T20:04:32Z","abstract_excerpt":"The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and the bottleneck spanning tree problem with conflict pair constraints are useful in modeling various real life applications. All these problems are known to be NP-hard. In this paper, we investigate these problems to obtain additional insights into the structure of the problems and to identify possible demarcation between easy and hard special cases. New polynomially solvable cases have been identified, as wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04451","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:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MM3FPBHd+6+UtB6dhwjN6Jq13oAQdRc3Jcqo286tc6Y/juWhsg7k38NnAZuniHdS17dJUQCiQWznBsvjf8ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:45:50.669458Z"},"content_sha256":"f2a53e7047a141e4bd689da7db7016818610439aac989099584173dd317abb6d","schema_version":"1.0","event_id":"sha256:f2a53e7047a141e4bd689da7db7016818610439aac989099584173dd317abb6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47/bundle.json","state_url":"https://pith.science/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47/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-07-01T02:45:50Z","links":{"resolver":"https://pith.science/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47","bundle":"https://pith.science/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47/bundle.json","state":"https://pith.science/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z6GB65TCI2MT5OHQUG4KQ3Y47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6Z6GB65TCI2MT5OHQUG4KQ3Y47","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":"dec988d277d8aa348ec731fe54b7e03ce4569851389dd81f86a38d684823179c","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T20:04:32Z","title_canon_sha256":"a68a8bbb0955a6a2110cea56d61472b245052385af1e824a12ebee7d2944b03f"},"schema_version":"1.0","source":{"id":"1603.04451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04451","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04451v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04451","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"6Z6GB65TCI2M","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6Z6GB65TCI2MT5OH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6Z6GB65T","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:f2a53e7047a141e4bd689da7db7016818610439aac989099584173dd317abb6d","target":"graph","created_at":"2026-05-18T01:19:04Z","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":"The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and the bottleneck spanning tree problem with conflict pair constraints are useful in modeling various real life applications. All these problems are known to be NP-hard. In this paper, we investigate these problems to obtain additional insights into the structure of the problems and to identify possible demarcation between easy and hard special cases. New polynomially solvable cases have been identified, as wel","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c, Ruonan Zhang","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T20:04:32Z","title":"The Quadratic Minimum Spanning Tree Problem and its Variations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04451","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:a9b123125ce4a0a95c9ef3b2e062f58c18ba245ec32f3e6281178b3f2d8913bc","target":"record","created_at":"2026-05-18T01:19:04Z","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":"dec988d277d8aa348ec731fe54b7e03ce4569851389dd81f86a38d684823179c","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T20:04:32Z","title_canon_sha256":"a68a8bbb0955a6a2110cea56d61472b245052385af1e824a12ebee7d2944b03f"},"schema_version":"1.0","source":{"id":"1603.04451","kind":"arxiv","version":1}},"canonical_sha256":"f67c60fbb31234c9f5c7850dc54378e7c6c953594b26967cfb98dea07eacada9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f67c60fbb31234c9f5c7850dc54378e7c6c953594b26967cfb98dea07eacada9","first_computed_at":"2026-05-18T01:19:04.905306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.905306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvj28qr3e81HMSRbE/DaOEkNDctkuHaTd2KLUS0nWCfWr3V5eJjHcvLk3Om5GLGX/l22YwKwGpZMuC+MS5DOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.905789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9b123125ce4a0a95c9ef3b2e062f58c18ba245ec32f3e6281178b3f2d8913bc","sha256:f2a53e7047a141e4bd689da7db7016818610439aac989099584173dd317abb6d"],"state_sha256":"d2ffc34f57161aaff5f38ebf0b87850bcbfabda4d2db34c50260789dee8b9cfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnPyBDmzSQInTu8SH99w4vsnxT0sjuVDqKEE3mYOrOQnor2xkRC/onydqKBEK68FM2ylyp5fKreURHf8N7CHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:45:50.671480Z","bundle_sha256":"92afafb36c88a0aabc43340126db11eca243e659ad77ec2cf8af76c123449397"}}