{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5JC345OD5IAGMTAFROSV3HNEVF","short_pith_number":"pith:5JC345OD","schema_version":"1.0","canonical_sha256":"ea45be75c3ea00664c058ba55d9da4a9757657036921893b8d850ebaf556d769","source":{"kind":"arxiv","id":"1805.05124","version":1},"attestation_state":"computed","paper":{"title":"Vector Programming Using Structural Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.PL","authors_text":"Marco T. Moraz\\'an (Seton Hall University)","submitted_at":"2018-05-14T11:43:52Z","abstract_excerpt":"Vector programming is an important topic in many Introduction to Computer Science courses. Despite the importance of vectors, learning vector programming is a source for frustration to  many students given that they feel left adrift when it comes to resolving vector indexing errors. Even though the size of a vector is a natural number, there have been no efforts to define a useful recursive data definition to help beginners design vector processing functions. This article defines the concept of a vector interval and describes how to exploit its recursive structure to design vector processing f"},"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":"1805.05124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-14T11:43:52Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"c2cb784c54f0712d2fbf12bf9d22f0537d577aba4a1a9cf13279d075d3f54cc3","abstract_canon_sha256":"276287dcd1cb32be597a297c9683a1bcc36b5126794eba09465db033a87c0e16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:43.006902Z","signature_b64":"PAqWz/aa1JZS7WR3KrSEEoCTcKRem2cMmSw8XgFJQink6CCMwCNFlrbF3evZ60yQ8pS8uYZdi/GxedLSskQuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea45be75c3ea00664c058ba55d9da4a9757657036921893b8d850ebaf556d769","last_reissued_at":"2026-05-18T00:15:43.006231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:43.006231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vector Programming Using Structural Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.PL","authors_text":"Marco T. Moraz\\'an (Seton Hall University)","submitted_at":"2018-05-14T11:43:52Z","abstract_excerpt":"Vector programming is an important topic in many Introduction to Computer Science courses. Despite the importance of vectors, learning vector programming is a source for frustration to  many students given that they feel left adrift when it comes to resolving vector indexing errors. Even though the size of a vector is a natural number, there have been no efforts to define a useful recursive data definition to help beginners design vector processing functions. This article defines the concept of a vector interval and describes how to exploit its recursive structure to design vector processing f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05124","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":"1805.05124","created_at":"2026-05-18T00:15:43.006374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05124v1","created_at":"2026-05-18T00:15:43.006374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05124","created_at":"2026-05-18T00:15:43.006374+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JC345OD5IAG","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JC345OD5IAGMTAF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JC345OD","created_at":"2026-05-18T12:32:08.215937+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/5JC345OD5IAGMTAFROSV3HNEVF","json":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF.json","graph_json":"https://pith.science/api/pith-number/5JC345OD5IAGMTAFROSV3HNEVF/graph.json","events_json":"https://pith.science/api/pith-number/5JC345OD5IAGMTAFROSV3HNEVF/events.json","paper":"https://pith.science/paper/5JC345OD"},"agent_actions":{"view_html":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF","download_json":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF.json","view_paper":"https://pith.science/paper/5JC345OD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05124&json=true","fetch_graph":"https://pith.science/api/pith-number/5JC345OD5IAGMTAFROSV3HNEVF/graph.json","fetch_events":"https://pith.science/api/pith-number/5JC345OD5IAGMTAFROSV3HNEVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF/action/storage_attestation","attest_author":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF/action/author_attestation","sign_citation":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF/action/citation_signature","submit_replication":"https://pith.science/pith/5JC345OD5IAGMTAFROSV3HNEVF/action/replication_record"}},"created_at":"2026-05-18T00:15:43.006374+00:00","updated_at":"2026-05-18T00:15:43.006374+00:00"}