{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:75U46ZOVREB5JMRHVMF4DU4F5O","short_pith_number":"pith:75U46ZOV","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"},"canonical_sha256":"ff69cf65d58903d4b227ab0bc1d385eba414081cedbb8b47c17b4f296fcf5bbc","source":{"kind":"arxiv","id":"1808.07832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07832","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07832v1","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07832","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"75U46ZOVREB5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"75U46ZOVREB5JMRH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"75U46ZOV","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:75U46ZOVREB5JMRHVMF4DU4F5O","target":"record","payload":{"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"},"canonical_sha256":"ff69cf65d58903d4b227ab0bc1d385eba414081cedbb8b47c17b4f296fcf5bbc","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"},"source_kind":"arxiv","source_id":"1808.07832","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:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c78TTpYHkZME1z0Magd5EAgk76aAwO9iJX0YAtE9M+vD4ezMvLaNG7DEY7uGNvI4Y1KKhbvGdHp+yAe8qeLEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:19:38.303306Z"},"content_sha256":"a527b2b4344a93628b028f34fee46d2c98b586808ccd371b436fd098c41acf79","schema_version":"1.0","event_id":"sha256:a527b2b4344a93628b028f34fee46d2c98b586808ccd371b436fd098c41acf79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:75U46ZOVREB5JMRHVMF4DU4F5O","target":"graph","payload":{"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"},"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:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adLRN+rKG4Dag/do1aTMj/4T3l3FeQvDMBTCWTfyqg30txGDuITReunSSMRbzyQCS4BEVZ55JK/UyEKKP27gBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:19:38.303668Z"},"content_sha256":"5a16aa43cf6b559649d78afd61a070e2643c8f646c8e2c988ee46e44564dcd28","schema_version":"1.0","event_id":"sha256:5a16aa43cf6b559649d78afd61a070e2643c8f646c8e2c988ee46e44564dcd28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/bundle.json","state_url":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75U46ZOVREB5JMRHVMF4DU4F5O/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-06-23T23:19:38Z","links":{"resolver":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O","bundle":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/bundle.json","state":"https://pith.science/pith/75U46ZOVREB5JMRHVMF4DU4F5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75U46ZOVREB5JMRHVMF4DU4F5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:75U46ZOVREB5JMRHVMF4DU4F5O","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":"3860a030c3a304c39172161025cd634680358ca3ba4db6d19a7566237f751d49","cross_cats_sorted":["cs.LO","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-20T23:17:06Z","title_canon_sha256":"4c67204922ce2d75f00425b1b264ea4337ffae031e5b00dbdc30238915a6e148"},"schema_version":"1.0","source":{"id":"1808.07832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07832","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07832v1","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07832","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"75U46ZOVREB5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"75U46ZOVREB5JMRH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"75U46ZOV","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:5a16aa43cf6b559649d78afd61a070e2643c8f646c8e2c988ee46e44564dcd28","target":"graph","created_at":"2026-05-18T00:07:24Z","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":"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","authors_text":"Devangi N. Parikh, Margaret E. Myers, Richard Vuduc, Robert A. van de Geijn","cross_cats":["cs.LO","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-20T23:17:06Z","title":"A Simple Methodology for Computing Families of Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07832","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:a527b2b4344a93628b028f34fee46d2c98b586808ccd371b436fd098c41acf79","target":"record","created_at":"2026-05-18T00:07:24Z","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":"3860a030c3a304c39172161025cd634680358ca3ba4db6d19a7566237f751d49","cross_cats_sorted":["cs.LO","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-20T23:17:06Z","title_canon_sha256":"4c67204922ce2d75f00425b1b264ea4337ffae031e5b00dbdc30238915a6e148"},"schema_version":"1.0","source":{"id":"1808.07832","kind":"arxiv","version":1}},"canonical_sha256":"ff69cf65d58903d4b227ab0bc1d385eba414081cedbb8b47c17b4f296fcf5bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff69cf65d58903d4b227ab0bc1d385eba414081cedbb8b47c17b4f296fcf5bbc","first_computed_at":"2026-05-18T00:07:24.183731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:24.183731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDWzRwXyKNbm9NbPjAIEzBFUqKMFPv6R/ULg1Az+xLk/nnfuD3qp7BJCV7PkxvuTp/GITlMXQF2yZdRP+Y/xCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:24.184206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a527b2b4344a93628b028f34fee46d2c98b586808ccd371b436fd098c41acf79","sha256:5a16aa43cf6b559649d78afd61a070e2643c8f646c8e2c988ee46e44564dcd28"],"state_sha256":"aaf5c8215d2514e33a97926dee6490d778f5111f94bbac36152843a758328f7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os4ckTGFAXYwWI+VhDJwaPhXbhqINQOYgNcx9qY5A8pMvs9f7OesV7ytIsgcLGd2894ICUrQ7K3X0espvspcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:19:38.305591Z","bundle_sha256":"3770fbedcb74b6e725ce4fbc697d7a53a185020b905a3e5539e4cc44221dedba"}}