{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NBFFYQNAFCTRKGHCG5YEMC6BOQ","short_pith_number":"pith:NBFFYQNA","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"},"canonical_sha256":"684a5c41a028a71518e23770460bc17417c2ddbf79765086615b673a6885d22f","source":{"kind":"arxiv","id":"1705.00314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00314","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00314v1","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00314","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"NBFFYQNAFCTR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NBFFYQNAFCTRKGHC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NBFFYQNA","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NBFFYQNAFCTRKGHCG5YEMC6BOQ","target":"record","payload":{"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"},"canonical_sha256":"684a5c41a028a71518e23770460bc17417c2ddbf79765086615b673a6885d22f","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"},"source_kind":"arxiv","source_id":"1705.00314","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-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NahXtGPULJyR/F6ly+Q/sH3a/dRyMsLCIWynC1SWm2gG501FWQ/sJQ+WABfFb/38/wTo9xJvyteQptfUy1FrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:56.908267Z"},"content_sha256":"99c1c4455c8300dfe30414f3c361a2ce4831ed96cf851b5f2028d435ae448d19","schema_version":"1.0","event_id":"sha256:99c1c4455c8300dfe30414f3c361a2ce4831ed96cf851b5f2028d435ae448d19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NBFFYQNAFCTRKGHCG5YEMC6BOQ","target":"graph","payload":{"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"},"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-05-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYv/JQpp6ftTev7w8SiuCThs5/TxVAjpXfBOD38UX7Him8ojW91RVZ9Uo3rVHUPzTEy0/oOsXjYmf+AT1np2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:56.908986Z"},"content_sha256":"8e4712f20ff6d1c1cd86037704968d4309381911235b85017a343b4745b0cd0c","schema_version":"1.0","event_id":"sha256:8e4712f20ff6d1c1cd86037704968d4309381911235b85017a343b4745b0cd0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/bundle.json","state_url":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/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-05-25T15:24:56Z","links":{"resolver":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ","bundle":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/bundle.json","state":"https://pith.science/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBFFYQNAFCTRKGHCG5YEMC6BOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NBFFYQNAFCTRKGHCG5YEMC6BOQ","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":"481d4d807863b9403bcd556ef8cfdd53b199fc2e374d3e5c9569a43cb21be21f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-30T13:30:01Z","title_canon_sha256":"8e06515a8aa99e37b24facc5f3b7f4cecf4113333dd8387c62e725f9b02edf70"},"schema_version":"1.0","source":{"id":"1705.00314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00314","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00314v1","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00314","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"NBFFYQNAFCTR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NBFFYQNAFCTRKGHC","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NBFFYQNA","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:8e4712f20ff6d1c1cd86037704968d4309381911235b85017a343b4745b0cd0c","target":"graph","created_at":"2026-05-18T00:45:20Z","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":"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","authors_text":"Aniket Murhekar, Hongfei Fu, Krishnendu Chatterjee","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-30T13:30:01Z","title":"Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00314","kind":"arxiv","version":1},"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:99c1c4455c8300dfe30414f3c361a2ce4831ed96cf851b5f2028d435ae448d19","target":"record","created_at":"2026-05-18T00:45:20Z","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":"481d4d807863b9403bcd556ef8cfdd53b199fc2e374d3e5c9569a43cb21be21f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-04-30T13:30:01Z","title_canon_sha256":"8e06515a8aa99e37b24facc5f3b7f4cecf4113333dd8387c62e725f9b02edf70"},"schema_version":"1.0","source":{"id":"1705.00314","kind":"arxiv","version":1}},"canonical_sha256":"684a5c41a028a71518e23770460bc17417c2ddbf79765086615b673a6885d22f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"684a5c41a028a71518e23770460bc17417c2ddbf79765086615b673a6885d22f","first_computed_at":"2026-05-18T00:45:20.807936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:20.807936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9AdVjsO7BHEgNAnzmqoABeLUedg5wEMuruN18kWh1vr6rqrB23tqvVH3z7gdK4V1mLc6cUsQ1s7/LMV7dqhGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:20.808667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99c1c4455c8300dfe30414f3c361a2ce4831ed96cf851b5f2028d435ae448d19","sha256:8e4712f20ff6d1c1cd86037704968d4309381911235b85017a343b4745b0cd0c"],"state_sha256":"c8e872e016671157d13f23d33aa891285dc5d71bc8f27d619004b725fb5e8b6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DO9Tb/zR9wEg550UxryCgOZT9Sl76Hmy1F5ZGeX06EQeUntwP1hNJ9P9WqcBX2XDD7AVNMECPYNv6AkjGr+VBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:24:56.913218Z","bundle_sha256":"d4e699f4935664e3de26fa14986b40a617989abfa590c73189f1d9f4dd643060"}}