{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6LZI6IQXZBUJNRWYIMKUM727K2","short_pith_number":"pith:6LZI6IQX","canonical_record":{"source":{"id":"2605.15142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T17:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"edc2fa7493d147857d97772689664625643568392687fa7b0e283170a099c544","abstract_canon_sha256":"65719140e2f2ef6f6a31cec15547ccd99cf53fe234cd401854dad1ad4d9f322c"},"schema_version":"1.0"},"canonical_sha256":"f2f28f2217c86896c6d84315467f5f5688684ba979822a29ea2f6e47af307ebc","source":{"kind":"arxiv","id":"2605.15142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15142","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15142v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"6LZI6IQXZBUJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6LZI6IQXZBUJNRWY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6LZI6IQX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6LZI6IQXZBUJNRWYIMKUM727K2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T17:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"edc2fa7493d147857d97772689664625643568392687fa7b0e283170a099c544","abstract_canon_sha256":"65719140e2f2ef6f6a31cec15547ccd99cf53fe234cd401854dad1ad4d9f322c"},"schema_version":"1.0"},"canonical_sha256":"f2f28f2217c86896c6d84315467f5f5688684ba979822a29ea2f6e47af307ebc","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"f2f28f2217c86896c6d84315467f5f5688684ba979822a29ea2f6e47af307ebc","last_reissued_at":"2026-05-17T21:57:18.877080Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.556870Z"},"source_kind":"arxiv","source_id":"2605.15142","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-17T21:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFdchd2E3sRbLEEf4d9OEN5Y8+VohVu9SMcvJf8ZErs2Cihk4k3o126QkYMH6pNhHfWV8wG7ity3L+nbBKLwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:40:06.397981Z"},"content_sha256":"d6bd604cffe2d2d99f778f36345f10e5dbeae3a1edb359a2452ec270fe9df9fc","schema_version":"1.0","event_id":"sha256:d6bd604cffe2d2d99f778f36345f10e5dbeae3a1edb359a2452ec270fe9df9fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6LZI6IQXZBUJNRWYIMKUM727K2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Creating treatment and component hierarchies in component network meta-analysis","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A workflow identifies uniquely estimable relative effects to build valid treatment hierarchies in component network meta-analysis.","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Adriani Nikolakopoulou, Audrey B\\'eliveau, Augustine Wigle, Lifeng Lin","submitted_at":"2026-05-14T17:46:51Z","abstract_excerpt":"Component network meta-analysis (CNMA) is a statistical methodology that enables estimation of relative effects for multi-component treatments, such as combinations of antidepressants, and individual components, such as single antidepressants, by synthesizing data from multiple studies. A commonly desired output of a systematic review and meta-analysis is a hierarchy of the treatments in terms of a certain performance metric. Methods have been established for standard network meta-analysis (NMA), but have not yet been extended to CNMA. In particular, CNMA presents unique challenges because the"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a step-by-step workflow for answering treatment hierarchy questions in both frequentist and Bayesian CNMA, including explicitly identifying the uniquely estimable relative effects.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That identifying uniquely estimable relative effects is always feasible from the network structure and sufficient to construct valid non-misleading hierarchies without further assumptions on connectivity or data.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A workflow for treatment hierarchies in CNMA that identifies uniquely estimable relative effects in frequentist and Bayesian settings.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A workflow identifies uniquely estimable relative effects to build valid treatment hierarchies in component network meta-analysis.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"954117978b878892b0d93a6b13e003a83da8924983e71d34914052dd502b7398"},"source":{"id":"2605.15142","kind":"arxiv","version":1},"verdict":{"id":"d742324b-ec6e-4ac5-b4d6-8a601a63b964","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:03:54.088339Z","strongest_claim":"We present a step-by-step workflow for answering treatment hierarchy questions in both frequentist and Bayesian CNMA, including explicitly identifying the uniquely estimable relative effects.","one_line_summary":"A workflow for treatment hierarchies in CNMA that identifies uniquely estimable relative effects in frequentist and Bayesian settings.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That identifying uniquely estimable relative effects is always feasible from the network structure and sufficient to construct valid non-misleading hierarchies without further assumptions on connectivity or data.","pith_extraction_headline":"A workflow identifies uniquely estimable relative effects to build valid treatment hierarchies in component network meta-analysis."},"references":{"count":133,"sample":[{"doi":"","year":2025,"title":"Ades, A. E. and Davies, Annabel L. and Phillippo, David M. and Pedder, Hugo and Thom, Howard and Downing, Beatrice and Caldwell, Deborah M. and Welton, Nicky J. , year = 2025, journal =. Treatment Rec","work_id":"c28c2542-eea2-465b-94d9-93649e3ba019","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Ades, A. E. and Welton, Nicky J. and Dias, Sofia and Phillippo, David M. and Caldwell, Deborah M. , year = 2024, journal =. Twenty Years of Network Meta-Analysis:","work_id":"f3c82b72-c6f2-4df7-a6d7-4224cabe582b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Electronic Journal of Statistics , volume =","work_id":"ce56d05d-ad0f-4c46-8fa1-e8e5764db821","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Al Mohamad, Diaa and Goeman, Jelle J. and. Simultaneous. Biometrics , volume =","work_id":"63418ad8-f716-44b0-abcb-726d4a394af4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"and Premji, Zahra A","work_id":"6d4a8a5a-602a-4272-9638-bcb64c19ceb3","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":133,"snapshot_sha256":"4e02e420ace1b6ba42c654d06705fc766a9d44dd0c4ac86cdcdf5488febb20e7","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":"d742324b-ec6e-4ac5-b4d6-8a601a63b964"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T21:57:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UtyvGN1cngrIUhydDeZRX79y5f1uYizgAH4+tAOB+KPs5MaEbmzcN6QlaJmswq4hKh/qOa9saTTZbXyZpZxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:40:06.398499Z"},"content_sha256":"237e41dc078b5837d9b5cb912d76def9376698330b8cf546610fab0a6878a942","schema_version":"1.0","event_id":"sha256:237e41dc078b5837d9b5cb912d76def9376698330b8cf546610fab0a6878a942"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LZI6IQXZBUJNRWYIMKUM727K2/bundle.json","state_url":"https://pith.science/pith/6LZI6IQXZBUJNRWYIMKUM727K2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LZI6IQXZBUJNRWYIMKUM727K2/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-03T17:40:06Z","links":{"resolver":"https://pith.science/pith/6LZI6IQXZBUJNRWYIMKUM727K2","bundle":"https://pith.science/pith/6LZI6IQXZBUJNRWYIMKUM727K2/bundle.json","state":"https://pith.science/pith/6LZI6IQXZBUJNRWYIMKUM727K2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LZI6IQXZBUJNRWYIMKUM727K2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6LZI6IQXZBUJNRWYIMKUM727K2","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":"65719140e2f2ef6f6a31cec15547ccd99cf53fe234cd401854dad1ad4d9f322c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T17:46:51Z","title_canon_sha256":"edc2fa7493d147857d97772689664625643568392687fa7b0e283170a099c544"},"schema_version":"1.0","source":{"id":"2605.15142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15142","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15142v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"6LZI6IQXZBUJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6LZI6IQXZBUJNRWY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6LZI6IQX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:237e41dc078b5837d9b5cb912d76def9376698330b8cf546610fab0a6878a942","target":"graph","created_at":"2026-05-17T21:57:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We present a step-by-step workflow for answering treatment hierarchy questions in both frequentist and Bayesian CNMA, including explicitly identifying the uniquely estimable relative effects."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That identifying uniquely estimable relative effects is always feasible from the network structure and sufficient to construct valid non-misleading hierarchies without further assumptions on connectivity or data."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A workflow for treatment hierarchies in CNMA that identifies uniquely estimable relative effects in frequentist and Bayesian settings."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A workflow identifies uniquely estimable relative effects to build valid treatment hierarchies in component network meta-analysis."}],"snapshot_sha256":"954117978b878892b0d93a6b13e003a83da8924983e71d34914052dd502b7398"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Component network meta-analysis (CNMA) is a statistical methodology that enables estimation of relative effects for multi-component treatments, such as combinations of antidepressants, and individual components, such as single antidepressants, by synthesizing data from multiple studies. A commonly desired output of a systematic review and meta-analysis is a hierarchy of the treatments in terms of a certain performance metric. Methods have been established for standard network meta-analysis (NMA), but have not yet been extended to CNMA. In particular, CNMA presents unique challenges because the","authors_text":"Adriani Nikolakopoulou, Audrey B\\'eliveau, Augustine Wigle, Lifeng Lin","cross_cats":[],"headline":"A workflow identifies uniquely estimable relative effects to build valid treatment hierarchies in component network meta-analysis.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T17:46:51Z","title":"Creating treatment and component hierarchies in component network meta-analysis"},"references":{"count":133,"internal_anchors":0,"resolved_work":133,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Ades, A. E. and Davies, Annabel L. and Phillippo, David M. and Pedder, Hugo and Thom, Howard and Downing, Beatrice and Caldwell, Deborah M. and Welton, Nicky J. , year = 2025, journal =. Treatment Rec","work_id":"c28c2542-eea2-465b-94d9-93649e3ba019","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Ades, A. E. and Welton, Nicky J. and Dias, Sofia and Phillippo, David M. and Caldwell, Deborah M. , year = 2024, journal =. Twenty Years of Network Meta-Analysis:","work_id":"f3c82b72-c6f2-4df7-a6d7-4224cabe582b","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Electronic Journal of Statistics , volume =","work_id":"ce56d05d-ad0f-4c46-8fa1-e8e5764db821","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Al Mohamad, Diaa and Goeman, Jelle J. and. Simultaneous. Biometrics , volume =","work_id":"63418ad8-f716-44b0-abcb-726d4a394af4","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"and Premji, Zahra A","work_id":"6d4a8a5a-602a-4272-9638-bcb64c19ceb3","year":null}],"snapshot_sha256":"4e02e420ace1b6ba42c654d06705fc766a9d44dd0c4ac86cdcdf5488febb20e7"},"source":{"id":"2605.15142","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:03:54.088339Z","id":"d742324b-ec6e-4ac5-b4d6-8a601a63b964","model_set":{"reader":"grok-4.3"},"one_line_summary":"A workflow for treatment hierarchies in CNMA that identifies uniquely estimable relative effects in frequentist and Bayesian settings.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A workflow identifies uniquely estimable relative effects to build valid treatment hierarchies in component network meta-analysis.","strongest_claim":"We present a step-by-step workflow for answering treatment hierarchy questions in both frequentist and Bayesian CNMA, including explicitly identifying the uniquely estimable relative effects.","weakest_assumption":"That identifying uniquely estimable relative effects is always feasible from the network structure and sufficient to construct valid non-misleading hierarchies without further assumptions on connectivity or data."}},"verdict_id":"d742324b-ec6e-4ac5-b4d6-8a601a63b964"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d6bd604cffe2d2d99f778f36345f10e5dbeae3a1edb359a2452ec270fe9df9fc","target":"record","created_at":"2026-05-17T21:18:33Z","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":"65719140e2f2ef6f6a31cec15547ccd99cf53fe234cd401854dad1ad4d9f322c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T17:46:51Z","title_canon_sha256":"edc2fa7493d147857d97772689664625643568392687fa7b0e283170a099c544"},"schema_version":"1.0","source":{"id":"2605.15142","kind":"arxiv","version":1}},"canonical_sha256":"f2f28f2217c86896c6d84315467f5f5688684ba979822a29ea2f6e47af307ebc","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2f28f2217c86896c6d84315467f5f5688684ba979822a29ea2f6e47af307ebc","first_computed_at":"2026-05-17T21:40:25.556870Z","kind":"pith_receipt","last_reissued_at":"2026-05-17T21:57:18.877080Z","receipt_version":"0.2","signature_status":"unsigned_v0"},"source_id":"2605.15142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6bd604cffe2d2d99f778f36345f10e5dbeae3a1edb359a2452ec270fe9df9fc","sha256:237e41dc078b5837d9b5cb912d76def9376698330b8cf546610fab0a6878a942"],"state_sha256":"67cbdb3fe1d385ae7ca9e0b8186e6e28ed8ba4c4cd3c422ac28057040de47248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sWCEnL/6rKyMgg4TvldaVB+5+pwfpFYBlHyshWWWBhAQHP549KQ0XIWV97VaGX5gDTbNHkyMi3OuwvibMuNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:40:06.400766Z","bundle_sha256":"6ef085e4446b12fd1fc57d09370ad79b6360d30036084dca180b3bc018f85bb7"}}