{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RXOHJWSBBBQYMYYDQYNONRENJV","short_pith_number":"pith:RXOHJWSB","schema_version":"1.0","canonical_sha256":"8ddc74da410861866303861ae6c48d4d683f88ec763ba50e7cebf0aede980c66","source":{"kind":"arxiv","id":"1008.3546","version":1},"attestation_state":"computed","paper":{"title":"Homogeneous and Non Homogeneous Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ioannis Paparrizos","submitted_at":"2010-08-20T17:58:00Z","abstract_excerpt":"Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with worst and best cases, homogeneous algorithms behave uniformly on all instances. This partition clarifies in a completely mathematical way the previously mentioned terms and reveals that in classifying an algorithm as homogeneous or not best case analysis is equally important with worst case analysis."},"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":"1008.3546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-20T17:58:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7459a3433cee59eb5b3d7d4762f6d0d70fe7e4fe30af287e7f1381887593c4d5","abstract_canon_sha256":"2d870f1255f186f413f962a2bde9fc5b32853d0c5bdc93e8bdb8d77c64ac43d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:02.201095Z","signature_b64":"tkBF/OUvkNStaPoharLKZGm6W3Ufy64iQWzrHvoQFr/kpROZRLjAqDDLJL9zwdXrnDsNdf2WRg0B53Sd+aQnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ddc74da410861866303861ae6c48d4d683f88ec763ba50e7cebf0aede980c66","last_reissued_at":"2026-05-18T04:42:02.200624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:02.200624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homogeneous and Non Homogeneous Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ioannis Paparrizos","submitted_at":"2010-08-20T17:58:00Z","abstract_excerpt":"Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with worst and best cases, homogeneous algorithms behave uniformly on all instances. This partition clarifies in a completely mathematical way the previously mentioned terms and reveals that in classifying an algorithm as homogeneous or not best case analysis is equally important with worst case analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3546","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":"1008.3546","created_at":"2026-05-18T04:42:02.200691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3546v1","created_at":"2026-05-18T04:42:02.200691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3546","created_at":"2026-05-18T04:42:02.200691+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXOHJWSBBBQY","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXOHJWSBBBQYMYYD","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXOHJWSB","created_at":"2026-05-18T12:26:13.927090+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/RXOHJWSBBBQYMYYDQYNONRENJV","json":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV.json","graph_json":"https://pith.science/api/pith-number/RXOHJWSBBBQYMYYDQYNONRENJV/graph.json","events_json":"https://pith.science/api/pith-number/RXOHJWSBBBQYMYYDQYNONRENJV/events.json","paper":"https://pith.science/paper/RXOHJWSB"},"agent_actions":{"view_html":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV","download_json":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV.json","view_paper":"https://pith.science/paper/RXOHJWSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3546&json=true","fetch_graph":"https://pith.science/api/pith-number/RXOHJWSBBBQYMYYDQYNONRENJV/graph.json","fetch_events":"https://pith.science/api/pith-number/RXOHJWSBBBQYMYYDQYNONRENJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV/action/storage_attestation","attest_author":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV/action/author_attestation","sign_citation":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV/action/citation_signature","submit_replication":"https://pith.science/pith/RXOHJWSBBBQYMYYDQYNONRENJV/action/replication_record"}},"created_at":"2026-05-18T04:42:02.200691+00:00","updated_at":"2026-05-18T04:42:02.200691+00:00"}