{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WPAUM2452ZBUF6Y4PGY6OBAAXX","short_pith_number":"pith:WPAUM245","canonical_record":{"source":{"id":"1712.04859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-13T16:49:42Z","cross_cats_sorted":[],"title_canon_sha256":"b77395892c7ad3bdc30e4b3ad0385b6382d95ae665ec970a6a2f8968ecaf5227","abstract_canon_sha256":"53ee3223c6d20d4092eb2bac7906a1aa880f07ba0ee3affc6faf01edbca5c00b"},"schema_version":"1.0"},"canonical_sha256":"b3c1466b9dd64342fb1c79b1e70400bde58e6c1b744fd1bb483af63abc4dcbe6","source":{"kind":"arxiv","id":"1712.04859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04859","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04859v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04859","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"WPAUM2452ZBU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WPAUM2452ZBUF6Y4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WPAUM245","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WPAUM2452ZBUF6Y4PGY6OBAAXX","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-13T16:49:42Z","cross_cats_sorted":[],"title_canon_sha256":"b77395892c7ad3bdc30e4b3ad0385b6382d95ae665ec970a6a2f8968ecaf5227","abstract_canon_sha256":"53ee3223c6d20d4092eb2bac7906a1aa880f07ba0ee3affc6faf01edbca5c00b"},"schema_version":"1.0"},"canonical_sha256":"b3c1466b9dd64342fb1c79b1e70400bde58e6c1b744fd1bb483af63abc4dcbe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.280698Z","signature_b64":"5sEH/CEKrRSepbBaYsSenLhcX3EZ0Ew/1M177+cPSmGQlPOKXokZl5akbHC8QcE2iD+G403W0aDzJXg0OGH6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3c1466b9dd64342fb1c79b1e70400bde58e6c1b744fd1bb483af63abc4dcbe6","last_reissued_at":"2026-05-18T00:28:03.279995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.279995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04859","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-18T00:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0yuaqueQYoC+fnJ7rT4BzHFydOZ76me092wf26nXqTB+ZotAlVPkeeSlKX0p05Z4X57zvgGfuSVdq/Z65yHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:27:38.870100Z"},"content_sha256":"520e9affe2ddfa1facf2e2964a1407e7bb575bc8ef6a088e6eb3ac7e734f1593","schema_version":"1.0","event_id":"sha256:520e9affe2ddfa1facf2e2964a1407e7bb575bc8ef6a088e6eb3ac7e734f1593"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WPAUM2452ZBUF6Y4PGY6OBAAXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rough Fuzzy Quadratic Minimum Spanning Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Saibal Majumder, Samarjit Kar, Tandra Pal","submitted_at":"2017-12-13T16:49:42Z","abstract_excerpt":"A quadratic minimum spanning tree (QMST) problem is to determine a minimum spanning tree of a connected graph having edges which are associated with linear and quadratic weights. The linear weights are the edge costs which are associated with every edge whereas the quadratic weights are the interaction costs between a pair of edges of the graph. In this paper, a bi-objective ({\\alpha},\\b{eta}) rough fuzzy quadratic minimum spanning tree problem (b-({\\alpha},\\b{eta})RFQMSTP) has been considered for a connected graph whose linear and quadratic weights are expressed as rough fuzzy variable. {\\alp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04859","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-18T00:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOfG3I+leF1VLX4Ez0OQEERgoNYoc+5MCd/wafijB1FXOHekquMaVQrkIulF4XWK1niivDIm+DVnugh6fNatCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:27:38.870458Z"},"content_sha256":"e883a6ee960dcb8a1145b61951e619ee9cd33827cc4d5044287a9e6ca23e10a5","schema_version":"1.0","event_id":"sha256:e883a6ee960dcb8a1145b61951e619ee9cd33827cc4d5044287a9e6ca23e10a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX/bundle.json","state_url":"https://pith.science/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX/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-29T21:27:38Z","links":{"resolver":"https://pith.science/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX","bundle":"https://pith.science/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX/bundle.json","state":"https://pith.science/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPAUM2452ZBUF6Y4PGY6OBAAXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WPAUM2452ZBUF6Y4PGY6OBAAXX","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":"53ee3223c6d20d4092eb2bac7906a1aa880f07ba0ee3affc6faf01edbca5c00b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-13T16:49:42Z","title_canon_sha256":"b77395892c7ad3bdc30e4b3ad0385b6382d95ae665ec970a6a2f8968ecaf5227"},"schema_version":"1.0","source":{"id":"1712.04859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04859","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04859v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04859","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"WPAUM2452ZBU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WPAUM2452ZBUF6Y4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WPAUM245","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:e883a6ee960dcb8a1145b61951e619ee9cd33827cc4d5044287a9e6ca23e10a5","target":"graph","created_at":"2026-05-18T00:28:03Z","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 quadratic minimum spanning tree (QMST) problem is to determine a minimum spanning tree of a connected graph having edges which are associated with linear and quadratic weights. The linear weights are the edge costs which are associated with every edge whereas the quadratic weights are the interaction costs between a pair of edges of the graph. In this paper, a bi-objective ({\\alpha},\\b{eta}) rough fuzzy quadratic minimum spanning tree problem (b-({\\alpha},\\b{eta})RFQMSTP) has been considered for a connected graph whose linear and quadratic weights are expressed as rough fuzzy variable. {\\alp","authors_text":"Saibal Majumder, Samarjit Kar, Tandra Pal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-13T16:49:42Z","title":"Rough Fuzzy Quadratic Minimum Spanning Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04859","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:520e9affe2ddfa1facf2e2964a1407e7bb575bc8ef6a088e6eb3ac7e734f1593","target":"record","created_at":"2026-05-18T00:28:03Z","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":"53ee3223c6d20d4092eb2bac7906a1aa880f07ba0ee3affc6faf01edbca5c00b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-13T16:49:42Z","title_canon_sha256":"b77395892c7ad3bdc30e4b3ad0385b6382d95ae665ec970a6a2f8968ecaf5227"},"schema_version":"1.0","source":{"id":"1712.04859","kind":"arxiv","version":1}},"canonical_sha256":"b3c1466b9dd64342fb1c79b1e70400bde58e6c1b744fd1bb483af63abc4dcbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3c1466b9dd64342fb1c79b1e70400bde58e6c1b744fd1bb483af63abc4dcbe6","first_computed_at":"2026-05-18T00:28:03.279995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:03.279995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5sEH/CEKrRSepbBaYsSenLhcX3EZ0Ew/1M177+cPSmGQlPOKXokZl5akbHC8QcE2iD+G403W0aDzJXg0OGH6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:03.280698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:520e9affe2ddfa1facf2e2964a1407e7bb575bc8ef6a088e6eb3ac7e734f1593","sha256:e883a6ee960dcb8a1145b61951e619ee9cd33827cc4d5044287a9e6ca23e10a5"],"state_sha256":"3666671f20fbbc5e6e1fde628b3e329094799a9aa2995f179884820c6a915550"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4Lbnk2Ue5oTF92UtpKnDsJQfeM5R9Mcy8g99fLQ+B9Fq5877JQyE4iqDlvQI1VMhYpLMWtzJtwerhus7d/PBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:27:38.872421Z","bundle_sha256":"95491745b3ae6b2f0a9e9ed839605b0f93750d58be07e94b2d29190aa3d5ffce"}}