{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LLNQUJHNYCTIXMEYM7R6RKA537","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":"d9adcac2d822518a3464fbdd3734eae96812f17d205dd13bf7c419b52ab31a26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-11T22:12:23Z","title_canon_sha256":"5890b180a829d819d989a99d637c0bdbca56de9c308bfa2635b421f8d1a1e6ec"},"schema_version":"1.0","source":{"id":"1505.02820","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02820","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02820v3","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02820","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"LLNQUJHNYCTI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLNQUJHNYCTIXMEY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLNQUJHN","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:d99e8c47f938b7270b086ed41a65973abb84425a6324daf3b61cf1539ded7b34","target":"graph","created_at":"2026-05-18T01:32:08Z","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":"Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are solved in optimal time within $\\Theta(n\\log{n})$ in the worst case over instances of size $n$. A finer analysis of those problems yields complexities within $O(n(1 + \\mathcal{H}(n_1, \\dots, n_k))) \\subseteq O(n(1{+}\\log{k})) \\subseteq O(n\\log{n})$ in the worst case over all instances of size $n$ composed of $k$ \"easy\" fragments of respective sizes $n_1, \\dots, n_k$ summing to $n$, where the entropy function $\\mathca","authors_text":"Carlos Ochoa, Jeremy Barbay, Pablo Perez-Lantero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-11T22:12:23Z","title":"Refining the Analysis of Divide and Conquer: How and When"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02820","kind":"arxiv","version":3},"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:24e8dd9c8a0d7ed948a77b468b9a399f2a8ce2b760c903bf920c41c2286e044b","target":"record","created_at":"2026-05-18T01:32:08Z","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":"d9adcac2d822518a3464fbdd3734eae96812f17d205dd13bf7c419b52ab31a26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-11T22:12:23Z","title_canon_sha256":"5890b180a829d819d989a99d637c0bdbca56de9c308bfa2635b421f8d1a1e6ec"},"schema_version":"1.0","source":{"id":"1505.02820","kind":"arxiv","version":3}},"canonical_sha256":"5adb0a24edc0a68bb09867e3e8a81ddfd3fa36a0525a2cc5d70f377d4fb2bd2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5adb0a24edc0a68bb09867e3e8a81ddfd3fa36a0525a2cc5d70f377d4fb2bd2d","first_computed_at":"2026-05-18T01:32:08.029708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:08.029708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IJ/ehO3CY4OqY2gjahileCCTsIofc9jT80bpmRbfyn60Z/nD8kmPiT7DZOV69XtAgjRpHKnYGm9XqvedZL46AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:08.030275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02820","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24e8dd9c8a0d7ed948a77b468b9a399f2a8ce2b760c903bf920c41c2286e044b","sha256:d99e8c47f938b7270b086ed41a65973abb84425a6324daf3b61cf1539ded7b34"],"state_sha256":"c976d6368609b018d0dd09c8330229915910b5d80623061bb2cb22350acb8b36"}