{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Z5KYQW2OSFB36STMCP3NQH7PXG","short_pith_number":"pith:Z5KYQW2O","canonical_record":{"source":{"id":"1312.1120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-04T11:54:34Z","cross_cats_sorted":[],"title_canon_sha256":"c2913bd699faa8988f2fb2f0fd70309128443ae71996c113e346c7858f2b5b71","abstract_canon_sha256":"50fea036c94b085020125ff366597df09096c3b9a62317ee3ac5e4c57ec84500"},"schema_version":"1.0"},"canonical_sha256":"cf55885b4e9143bf4a6c13f6d81fefb98255b653481ef58ecf3e7990ce7a5c96","source":{"kind":"arxiv","id":"1312.1120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1120","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1120v1","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1120","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"Z5KYQW2OSFB3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z5KYQW2OSFB36STM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z5KYQW2O","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Z5KYQW2OSFB36STMCP3NQH7PXG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-04T11:54:34Z","cross_cats_sorted":[],"title_canon_sha256":"c2913bd699faa8988f2fb2f0fd70309128443ae71996c113e346c7858f2b5b71","abstract_canon_sha256":"50fea036c94b085020125ff366597df09096c3b9a62317ee3ac5e4c57ec84500"},"schema_version":"1.0"},"canonical_sha256":"cf55885b4e9143bf4a6c13f6d81fefb98255b653481ef58ecf3e7990ce7a5c96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:34.932767Z","signature_b64":"g1a8v+7yRsXNWGmwiez4gikZxuP/63xyJvQYhYZ9hcA81IWPvccHaXWFH8Jm5MuETRASgTLhl2udtPx+r9CLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf55885b4e9143bf4a6c13f6d81fefb98255b653481ef58ecf3e7990ce7a5c96","last_reissued_at":"2026-05-18T03:05:34.932211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:34.932211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1120","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-18T03:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wag6NIAg4NoJLyT21Dny/NMZHzVPFbAGbjkOkdELIL7Th5pj3UjRfdnZPy7oQn3G7cFeGQugL4Step67Bdn8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:32:25.372347Z"},"content_sha256":"f1a3d715d2243a8fbf00bbe515c884b31546b62c1f83e843d7f9bd7670f35929","schema_version":"1.0","event_id":"sha256:f1a3d715d2243a8fbf00bbe515c884b31546b62c1f83e843d7f9bd7670f35929"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Z5KYQW2OSFB36STMCP3NQH7PXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Game Semantics for Generic Polymorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Radha Jagadeesan, Samson Abramsky","submitted_at":"2013-12-04T11:54:34Z","abstract_excerpt":"Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type $\\forall X. \\, A[X]$, are equal at any given instance $A[T]$, then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but finding a semantically motivated model satisfying this principle remained an open problem.\n  In the present paper, we cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1120","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-18T03:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRPzAG+3HHAWiVlStrl9JyVp/yhz/70vcV3W8vNikIGkMZytrJ8HxtN2T4FvZ/UhVPXOWy+7Yhx8fZLuDPfFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T05:32:25.372698Z"},"content_sha256":"544d097690f3dc40d237b3a71691bf50f2438c3959711911612d90c489a4a03a","schema_version":"1.0","event_id":"sha256:544d097690f3dc40d237b3a71691bf50f2438c3959711911612d90c489a4a03a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5KYQW2OSFB36STMCP3NQH7PXG/bundle.json","state_url":"https://pith.science/pith/Z5KYQW2OSFB36STMCP3NQH7PXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5KYQW2OSFB36STMCP3NQH7PXG/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-05-21T05:32:25Z","links":{"resolver":"https://pith.science/pith/Z5KYQW2OSFB36STMCP3NQH7PXG","bundle":"https://pith.science/pith/Z5KYQW2OSFB36STMCP3NQH7PXG/bundle.json","state":"https://pith.science/pith/Z5KYQW2OSFB36STMCP3NQH7PXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5KYQW2OSFB36STMCP3NQH7PXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z5KYQW2OSFB36STMCP3NQH7PXG","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":"50fea036c94b085020125ff366597df09096c3b9a62317ee3ac5e4c57ec84500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-04T11:54:34Z","title_canon_sha256":"c2913bd699faa8988f2fb2f0fd70309128443ae71996c113e346c7858f2b5b71"},"schema_version":"1.0","source":{"id":"1312.1120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1120","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1120v1","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1120","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"Z5KYQW2OSFB3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z5KYQW2OSFB36STM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z5KYQW2O","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:544d097690f3dc40d237b3a71691bf50f2438c3959711911612d90c489a4a03a","target":"graph","created_at":"2026-05-18T03:05:34Z","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":"Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type $\\forall X. \\, A[X]$, are equal at any given instance $A[T]$, then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but finding a semantically motivated model satisfying this principle remained an open problem.\n  In the present paper, we cons","authors_text":"Radha Jagadeesan, Samson Abramsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-04T11:54:34Z","title":"A Game Semantics for Generic Polymorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1120","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:f1a3d715d2243a8fbf00bbe515c884b31546b62c1f83e843d7f9bd7670f35929","target":"record","created_at":"2026-05-18T03:05:34Z","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":"50fea036c94b085020125ff366597df09096c3b9a62317ee3ac5e4c57ec84500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-04T11:54:34Z","title_canon_sha256":"c2913bd699faa8988f2fb2f0fd70309128443ae71996c113e346c7858f2b5b71"},"schema_version":"1.0","source":{"id":"1312.1120","kind":"arxiv","version":1}},"canonical_sha256":"cf55885b4e9143bf4a6c13f6d81fefb98255b653481ef58ecf3e7990ce7a5c96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf55885b4e9143bf4a6c13f6d81fefb98255b653481ef58ecf3e7990ce7a5c96","first_computed_at":"2026-05-18T03:05:34.932211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:34.932211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1a8v+7yRsXNWGmwiez4gikZxuP/63xyJvQYhYZ9hcA81IWPvccHaXWFH8Jm5MuETRASgTLhl2udtPx+r9CLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:34.932767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1a3d715d2243a8fbf00bbe515c884b31546b62c1f83e843d7f9bd7670f35929","sha256:544d097690f3dc40d237b3a71691bf50f2438c3959711911612d90c489a4a03a"],"state_sha256":"e56ba571bb7552023d43be8b1555e38d47ed2757a869788a47d074ab35f1a0d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2Y3gBWQaQdLVblpA6XS9tE0ZtYFZ3D0UiipRSX+8z9xQSA/jwZpcQq624d8ti53aqoLz7ASjOBiTcaOR1a8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T05:32:25.374613Z","bundle_sha256":"ce3c1bc558148fed1c8aa0c2f2416187e6f07715ed7d076e8a7a95e44e5780b2"}}