{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NBFFYQNAFCTRKGHCG5YEMC6BOQ","short_pith_number":"pith:NBFFYQNA","schema_version":"1.0","canonical_sha256":"684a5c41a028a71518e23770460bc17417c2ddbf79765086615b673a6885d22f","source":{"kind":"arxiv","id":"1705.00314","version":1},"attestation_state":"computed","paper":{"title":"Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PL","authors_text":"Aniket Murhekar, Hongfei Fu, Krishnendu Chatterjee","submitted_at":"2017-04-30T13:30:01Z","abstract_excerpt":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. Several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPON-COLLECTOR). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear, or almost-linear ($\\mathcal{O}(\\log n)$, $\\mathcal{O}(n)$, $\\mathcal{O}(n\\cdot\\log n)$, respec"},"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":"1705.00314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-30T13:30:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8e06515a8aa99e37b24facc5f3b7f4cecf4113333dd8387c62e725f9b02edf70","abstract_canon_sha256":"481d4d807863b9403bcd556ef8cfdd53b199fc2e374d3e5c9569a43cb21be21f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:20.808667Z","signature_b64":"9AdVjsO7BHEgNAnzmqoABeLUedg5wEMuruN18kWh1vr6rqrB23tqvVH3z7gdK4V1mLc6cUsQ1s7/LMV7dqhGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684a5c41a028a71518e23770460bc17417c2ddbf79765086615b673a6885d22f","last_reissued_at":"2026-05-18T00:45:20.807936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:20.807936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PL","authors_text":"Aniket Murhekar, Hongfei Fu, Krishnendu Chatterjee","submitted_at":"2017-04-30T13:30:01Z","abstract_excerpt":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. Several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPON-COLLECTOR). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear, or almost-linear ($\\mathcal{O}(\\log n)$, $\\mathcal{O}(n)$, $\\mathcal{O}(n\\cdot\\log n)$, respec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00314","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.00314","created_at":"2026-05-18T00:45:20.808041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00314v1","created_at":"2026-05-18T00:45:20.808041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00314","created_at":"2026-05-18T00:45:20.808041+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBFFYQNAFCTR","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBFFYQNAFCTRKGHC","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBFFYQNA","created_at":"2026-05-18T12:31:31.346846+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/NBFFYQNAFCTRKGHCG5YEMC6BOQ","json":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ.json","graph_json":"https://pith.science/api/pith-number/NBFFYQNAFCTRKGHCG5YEMC6BOQ/graph.json","events_json":"https://pith.science/api/pith-number/NBFFYQNAFCTRKGHCG5YEMC6BOQ/events.json","paper":"https://pith.science/paper/NBFFYQNA"},"agent_actions":{"view_html":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ","download_json":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ.json","view_paper":"https://pith.science/paper/NBFFYQNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00314&json=true","fetch_graph":"https://pith.science/api/pith-number/NBFFYQNAFCTRKGHCG5YEMC6BOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NBFFYQNAFCTRKGHCG5YEMC6BOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/action/storage_attestation","attest_author":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/action/author_attestation","sign_citation":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/action/citation_signature","submit_replication":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/action/replication_record"}},"created_at":"2026-05-18T00:45:20.808041+00:00","updated_at":"2026-05-18T00:45:20.808041+00:00"}