{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LLNQUJHNYCTIXMEYM7R6RKA537","short_pith_number":"pith:LLNQUJHN","schema_version":"1.0","canonical_sha256":"5adb0a24edc0a68bb09867e3e8a81ddfd3fa36a0525a2cc5d70f377d4fb2bd2d","source":{"kind":"arxiv","id":"1505.02820","version":3},"attestation_state":"computed","paper":{"title":"Refining the Analysis of Divide and Conquer: How and When","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carlos Ochoa, Jeremy Barbay, Pablo Perez-Lantero","submitted_at":"2015-05-11T22:12:23Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.02820","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-11T22:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"5890b180a829d819d989a99d637c0bdbca56de9c308bfa2635b421f8d1a1e6ec","abstract_canon_sha256":"d9adcac2d822518a3464fbdd3734eae96812f17d205dd13bf7c419b52ab31a26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:08.030275Z","signature_b64":"IJ/ehO3CY4OqY2gjahileCCTsIofc9jT80bpmRbfyn60Z/nD8kmPiT7DZOV69XtAgjRpHKnYGm9XqvedZL46AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5adb0a24edc0a68bb09867e3e8a81ddfd3fa36a0525a2cc5d70f377d4fb2bd2d","last_reissued_at":"2026-05-18T01:32:08.029708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:08.029708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refining the Analysis of Divide and Conquer: How and When","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carlos Ochoa, Jeremy Barbay, Pablo Perez-Lantero","submitted_at":"2015-05-11T22:12:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02820","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02820","created_at":"2026-05-18T01:32:08.029795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02820v3","created_at":"2026-05-18T01:32:08.029795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02820","created_at":"2026-05-18T01:32:08.029795+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLNQUJHNYCTI","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLNQUJHNYCTIXMEY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLNQUJHN","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537","json":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537.json","graph_json":"https://pith.science/api/pith-number/LLNQUJHNYCTIXMEYM7R6RKA537/graph.json","events_json":"https://pith.science/api/pith-number/LLNQUJHNYCTIXMEYM7R6RKA537/events.json","paper":"https://pith.science/paper/LLNQUJHN"},"agent_actions":{"view_html":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537","download_json":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537.json","view_paper":"https://pith.science/paper/LLNQUJHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02820&json=true","fetch_graph":"https://pith.science/api/pith-number/LLNQUJHNYCTIXMEYM7R6RKA537/graph.json","fetch_events":"https://pith.science/api/pith-number/LLNQUJHNYCTIXMEYM7R6RKA537/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537/action/storage_attestation","attest_author":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537/action/author_attestation","sign_citation":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537/action/citation_signature","submit_replication":"https://pith.science/pith/LLNQUJHNYCTIXMEYM7R6RKA537/action/replication_record"}},"created_at":"2026-05-18T01:32:08.029795+00:00","updated_at":"2026-05-18T01:32:08.029795+00:00"}