{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7QXPTGXGV47QXBDDDRRPOTNXHV","short_pith_number":"pith:7QXPTGXG","canonical_record":{"source":{"id":"2211.12441","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-22T17:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"5c5923a92f1b9eaac8160305ada29b59167115fdd5f88554dcd67059dd2f7bb7","abstract_canon_sha256":"34a54aa475618bb8acf7b5c0373527cf431b9c10299cb40bd96e77ac8a63c808"},"schema_version":"1.0"},"canonical_sha256":"fc2ef99ae6af3f0b84631c62f74db73d7ead650e47e4b4bb9e34d172a725be75","source":{"kind":"arxiv","id":"2211.12441","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12441","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12441v2","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12441","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"7QXPTGXGV47Q","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"pith_short_16","alias_value":"7QXPTGXGV47QXBDD","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"pith_short_8","alias_value":"7QXPTGXG","created_at":"2026-07-05T08:38:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7QXPTGXGV47QXBDDDRRPOTNXHV","target":"record","payload":{"canonical_record":{"source":{"id":"2211.12441","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-22T17:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"5c5923a92f1b9eaac8160305ada29b59167115fdd5f88554dcd67059dd2f7bb7","abstract_canon_sha256":"34a54aa475618bb8acf7b5c0373527cf431b9c10299cb40bd96e77ac8a63c808"},"schema_version":"1.0"},"canonical_sha256":"fc2ef99ae6af3f0b84631c62f74db73d7ead650e47e4b4bb9e34d172a725be75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:32.308615Z","signature_b64":"j2n3stqHZ9jec+cUUz2HXWyvmRsiQosH/2D/zApt/76ghEtJa39ohB1Ip5wifQbFsGYHTmsWN4fvaaPkc0i+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc2ef99ae6af3f0b84631c62f74db73d7ead650e47e4b4bb9e34d172a725be75","last_reissued_at":"2026-07-05T08:38:32.308130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:32.308130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.12441","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-07-05T08:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8a286O+M4J8QHny5OjtsocZbUSmViffn8UIPYFlFwVscLhWZnKZRZrRVZ+brsiKIibC2KLRpqKYF2KXP8UZiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T01:19:21.890789Z"},"content_sha256":"91508942819be13a398747aed3d7d68f62792d12542b7ba16434398df65f3334","schema_version":"1.0","event_id":"sha256:91508942819be13a398747aed3d7d68f62792d12542b7ba16434398df65f3334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7QXPTGXGV47QXBDDDRRPOTNXHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Morgan, Dieter van Melkebeek, Ivan Hu","submitted_at":"2022-11-22T17:51:02Z","abstract_excerpt":"Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical psychology, with the evaluation of the Mann--Whitney statistic for detecting differences between distributions as a special case.\n  We study the complexity of the problem in the comparison-query model, used for problems like sorting and selection. For many types of trees with $n$ leaves, we establish lower bounds close to the strongest known in the model, namel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12441","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.12441/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2i0xfKrxCEhsgitQaNLvg4pF8Hd6xQ3z4GkuSqOBIrwf0AwnhM15qO/PtBN0Z0NNLMaGou3Cgxr5CJ78TG2+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T01:19:21.891823Z"},"content_sha256":"91b5d44eca0bc54148a6993db17b6ff97eec131d9a8cf93a2a69e277a6d5b150","schema_version":"1.0","event_id":"sha256:91b5d44eca0bc54148a6993db17b6ff97eec131d9a8cf93a2a69e277a6d5b150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QXPTGXGV47QXBDDDRRPOTNXHV/bundle.json","state_url":"https://pith.science/pith/7QXPTGXGV47QXBDDDRRPOTNXHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QXPTGXGV47QXBDDDRRPOTNXHV/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-08-16T01:19:21Z","links":{"resolver":"https://pith.science/pith/7QXPTGXGV47QXBDDDRRPOTNXHV","bundle":"https://pith.science/pith/7QXPTGXGV47QXBDDDRRPOTNXHV/bundle.json","state":"https://pith.science/pith/7QXPTGXGV47QXBDDDRRPOTNXHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QXPTGXGV47QXBDDDRRPOTNXHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7QXPTGXGV47QXBDDDRRPOTNXHV","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":"34a54aa475618bb8acf7b5c0373527cf431b9c10299cb40bd96e77ac8a63c808","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-22T17:51:02Z","title_canon_sha256":"5c5923a92f1b9eaac8160305ada29b59167115fdd5f88554dcd67059dd2f7bb7"},"schema_version":"1.0","source":{"id":"2211.12441","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12441","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12441v2","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12441","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"7QXPTGXGV47Q","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"pith_short_16","alias_value":"7QXPTGXGV47QXBDD","created_at":"2026-07-05T08:38:32Z"},{"alias_kind":"pith_short_8","alias_value":"7QXPTGXG","created_at":"2026-07-05T08:38:32Z"}],"graph_snapshots":[{"event_id":"sha256:91b5d44eca0bc54148a6993db17b6ff97eec131d9a8cf93a2a69e277a6d5b150","target":"graph","created_at":"2026-07-05T08:38:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.12441/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical psychology, with the evaluation of the Mann--Whitney statistic for detecting differences between distributions as a special case.\n  We study the complexity of the problem in the comparison-query model, used for problems like sorting and selection. For many types of trees with $n$ leaves, we establish lower bounds close to the strongest known in the model, namel","authors_text":"Andrew Morgan, Dieter van Melkebeek, Ivan Hu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-22T17:51:02Z","title":"Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12441","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:91508942819be13a398747aed3d7d68f62792d12542b7ba16434398df65f3334","target":"record","created_at":"2026-07-05T08:38:32Z","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":"34a54aa475618bb8acf7b5c0373527cf431b9c10299cb40bd96e77ac8a63c808","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-22T17:51:02Z","title_canon_sha256":"5c5923a92f1b9eaac8160305ada29b59167115fdd5f88554dcd67059dd2f7bb7"},"schema_version":"1.0","source":{"id":"2211.12441","kind":"arxiv","version":2}},"canonical_sha256":"fc2ef99ae6af3f0b84631c62f74db73d7ead650e47e4b4bb9e34d172a725be75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2ef99ae6af3f0b84631c62f74db73d7ead650e47e4b4bb9e34d172a725be75","first_computed_at":"2026-07-05T08:38:32.308130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:32.308130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j2n3stqHZ9jec+cUUz2HXWyvmRsiQosH/2D/zApt/76ghEtJa39ohB1Ip5wifQbFsGYHTmsWN4fvaaPkc0i+Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:32.308615Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.12441","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91508942819be13a398747aed3d7d68f62792d12542b7ba16434398df65f3334","sha256:91b5d44eca0bc54148a6993db17b6ff97eec131d9a8cf93a2a69e277a6d5b150"],"state_sha256":"565c759423350ae9f0354eeb49b32a8937387b15ae0b64b170811c4969947867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snroHDThhTTbU0c/W0EvOJCuLhv4Vxmi+NrYq9uPtQYdc3fm6VqWqoLW/5ED7WLBvXq7aBc88g805aWFs5o1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T01:19:21.904946Z","bundle_sha256":"58d22fa2066ed9b798c62476420dae43d0d72d1015e7d139077c5145b3ccd43a"}}