{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NGWMA5QUXWSLXQLK4F3UV2EF2I","short_pith_number":"pith:NGWMA5QU","schema_version":"1.0","canonical_sha256":"69acc07614bda4bbc16ae1774ae885d2273d6c9532428906b1a9b2462b222cc9","source":{"kind":"arxiv","id":"1808.06052","version":5},"attestation_state":"computed","paper":{"title":"Doubly F-Bounded Generics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Moez A. AbdelGawad","submitted_at":"2018-08-18T07:19:08Z","abstract_excerpt":"In this paper we suggest how f-bounded generics in nominally-typed OOP can be extended to the more general notion we call `doubly f-bounded generics' and we suggest how doubly f-bounded generics can be reasoned about. We also (attempt to) prove, using a coinductive argument, that our reasoning method is mathematically sound."},"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.06052","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-18T07:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"37319fadf8d8dc59892aa9baa4684a9f1f44170dddc3b3c583b4d9e9ee4c1b8d","abstract_canon_sha256":"284383816f821f9164206f0059960a8acf1e6e7a979f64616bae00fa334ef79c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:19.992912Z","signature_b64":"LyH6DdhsBIu5YFN4Aw42ZTzpTWksvcGgu70o/uuk0786oe6pxhJcp9rJDbt0ED8549rT/fGcfS8jP+XIg9TjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69acc07614bda4bbc16ae1774ae885d2273d6c9532428906b1a9b2462b222cc9","last_reissued_at":"2026-05-18T00:06:19.992477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:19.992477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly F-Bounded Generics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Moez A. AbdelGawad","submitted_at":"2018-08-18T07:19:08Z","abstract_excerpt":"In this paper we suggest how f-bounded generics in nominally-typed OOP can be extended to the more general notion we call `doubly f-bounded generics' and we suggest how doubly f-bounded generics can be reasoned about. We also (attempt to) prove, using a coinductive argument, that our reasoning method is mathematically sound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06052","kind":"arxiv","version":5},"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.06052","created_at":"2026-05-18T00:06:19.992536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06052v5","created_at":"2026-05-18T00:06:19.992536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06052","created_at":"2026-05-18T00:06:19.992536+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGWMA5QUXWSL","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGWMA5QUXWSLXQLK","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGWMA5QU","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11197","citing_title":"Java Generics: An Order-Theoretic Approach (Abridged Outline)","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I","json":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I.json","graph_json":"https://pith.science/api/pith-number/NGWMA5QUXWSLXQLK4F3UV2EF2I/graph.json","events_json":"https://pith.science/api/pith-number/NGWMA5QUXWSLXQLK4F3UV2EF2I/events.json","paper":"https://pith.science/paper/NGWMA5QU"},"agent_actions":{"view_html":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I","download_json":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I.json","view_paper":"https://pith.science/paper/NGWMA5QU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06052&json=true","fetch_graph":"https://pith.science/api/pith-number/NGWMA5QUXWSLXQLK4F3UV2EF2I/graph.json","fetch_events":"https://pith.science/api/pith-number/NGWMA5QUXWSLXQLK4F3UV2EF2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I/action/storage_attestation","attest_author":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I/action/author_attestation","sign_citation":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I/action/citation_signature","submit_replication":"https://pith.science/pith/NGWMA5QUXWSLXQLK4F3UV2EF2I/action/replication_record"}},"created_at":"2026-05-18T00:06:19.992536+00:00","updated_at":"2026-05-18T00:06:19.992536+00:00"}