{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:42ILVD4NPRXMVKJXOZDETQLLJB","short_pith_number":"pith:42ILVD4N","schema_version":"1.0","canonical_sha256":"e690ba8f8d7c6ecaa937764649c16b4855fcbbfaca9c8477c54e5b2beb518190","source":{"kind":"arxiv","id":"1505.03218","version":1},"attestation_state":"computed","paper":{"title":"Musings on generic-case complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.LO"],"primary_cat":"cs.CC","authors_text":"Ilya Kapovich","submitted_at":"2015-05-13T02:08:12Z","abstract_excerpt":"We propose a more general definition of generic-case complexity, based on using a random process for generating inputs of an algorithm and using the time needed to generate an input as a way of measuring the size of that input."},"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.03218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T02:08:12Z","cross_cats_sorted":["math.GR","math.LO"],"title_canon_sha256":"c69e9960af1d62bfe66ce47006100f5e042227a6a06e333b3bca1ee33c500c5d","abstract_canon_sha256":"761d4c632e550c41d892e898a379f44a99917cf59ad6a8369e33db0fb5b4e187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.062334Z","signature_b64":"Gh7vH3gRKm5O2SjXYD2Da84uRI2BAkmhHAC+arFbcQAKiMooTu4PoP2fIMDVEXq3Gt2X3tZ7u4xGrPozj7KGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e690ba8f8d7c6ecaa937764649c16b4855fcbbfaca9c8477c54e5b2beb518190","last_reissued_at":"2026-05-18T02:12:10.061483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.061483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Musings on generic-case complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.LO"],"primary_cat":"cs.CC","authors_text":"Ilya Kapovich","submitted_at":"2015-05-13T02:08:12Z","abstract_excerpt":"We propose a more general definition of generic-case complexity, based on using a random process for generating inputs of an algorithm and using the time needed to generate an input as a way of measuring the size of that input."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03218","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":"1505.03218","created_at":"2026-05-18T02:12:10.061626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03218v1","created_at":"2026-05-18T02:12:10.061626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03218","created_at":"2026-05-18T02:12:10.061626+00:00"},{"alias_kind":"pith_short_12","alias_value":"42ILVD4NPRXM","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"42ILVD4NPRXMVKJX","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"42ILVD4N","created_at":"2026-05-18T12:29:02.477457+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/42ILVD4NPRXMVKJXOZDETQLLJB","json":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB.json","graph_json":"https://pith.science/api/pith-number/42ILVD4NPRXMVKJXOZDETQLLJB/graph.json","events_json":"https://pith.science/api/pith-number/42ILVD4NPRXMVKJXOZDETQLLJB/events.json","paper":"https://pith.science/paper/42ILVD4N"},"agent_actions":{"view_html":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB","download_json":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB.json","view_paper":"https://pith.science/paper/42ILVD4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03218&json=true","fetch_graph":"https://pith.science/api/pith-number/42ILVD4NPRXMVKJXOZDETQLLJB/graph.json","fetch_events":"https://pith.science/api/pith-number/42ILVD4NPRXMVKJXOZDETQLLJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB/action/storage_attestation","attest_author":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB/action/author_attestation","sign_citation":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB/action/citation_signature","submit_replication":"https://pith.science/pith/42ILVD4NPRXMVKJXOZDETQLLJB/action/replication_record"}},"created_at":"2026-05-18T02:12:10.061626+00:00","updated_at":"2026-05-18T02:12:10.061626+00:00"}