{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:75U46ZOVREB5JMRHVMF4DU4F5O","short_pith_number":"pith:75U46ZOV","schema_version":"1.0","canonical_sha256":"ff69cf65d58903d4b227ab0bc1d385eba414081cedbb8b47c17b4f296fcf5bbc","source":{"kind":"arxiv","id":"1808.07832","version":1},"attestation_state":"computed","paper":{"title":"A Simple Methodology for Computing Families of Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.MS"],"primary_cat":"cs.PL","authors_text":"Devangi N. Parikh, Margaret E. Myers, Richard Vuduc, Robert A. van de Geijn","submitted_at":"2018-08-20T23:17:06Z","abstract_excerpt":"Discovering \"good\" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for t"},"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":"1808.07832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-20T23:17:06Z","cross_cats_sorted":["cs.LO","cs.MS"],"title_canon_sha256":"4c67204922ce2d75f00425b1b264ea4337ffae031e5b00dbdc30238915a6e148","abstract_canon_sha256":"3860a030c3a304c39172161025cd634680358ca3ba4db6d19a7566237f751d49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:24.184206Z","signature_b64":"iDWzRwXyKNbm9NbPjAIEzBFUqKMFPv6R/ULg1Az+xLk/nnfuD3qp7BJCV7PkxvuTp/GITlMXQF2yZdRP+Y/xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff69cf65d58903d4b227ab0bc1d385eba414081cedbb8b47c17b4f296fcf5bbc","last_reissued_at":"2026-05-18T00:07:24.183731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:24.183731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Methodology for Computing Families of Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.MS"],"primary_cat":"cs.PL","authors_text":"Devangi N. Parikh, Margaret E. Myers, Richard Vuduc, Robert A. van de Geijn","submitted_at":"2018-08-20T23:17:06Z","abstract_excerpt":"Discovering \"good\" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07832","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":"1808.07832","created_at":"2026-05-18T00:07:24.183807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07832v1","created_at":"2026-05-18T00:07:24.183807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07832","created_at":"2026-05-18T00:07:24.183807+00:00"},{"alias_kind":"pith_short_12","alias_value":"75U46ZOVREB5","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"75U46ZOVREB5JMRH","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"75U46ZOV","created_at":"2026-05-18T12:32:11.075285+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/75U46ZOVREB5JMRHVMF4DU4F5O","json":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O.json","graph_json":"https://pith.science/api/pith-number/75U46ZOVREB5JMRHVMF4DU4F5O/graph.json","events_json":"https://pith.science/api/pith-number/75U46ZOVREB5JMRHVMF4DU4F5O/events.json","paper":"https://pith.science/paper/75U46ZOV"},"agent_actions":{"view_html":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O","download_json":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O.json","view_paper":"https://pith.science/paper/75U46ZOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07832&json=true","fetch_graph":"https://pith.science/api/pith-number/75U46ZOVREB5JMRHVMF4DU4F5O/graph.json","fetch_events":"https://pith.science/api/pith-number/75U46ZOVREB5JMRHVMF4DU4F5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/action/storage_attestation","attest_author":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/action/author_attestation","sign_citation":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/action/citation_signature","submit_replication":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/action/replication_record"}},"created_at":"2026-05-18T00:07:24.183807+00:00","updated_at":"2026-05-18T00:07:24.183807+00:00"}