{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:KAZNXXG23OVKM6BQSJ6F2OG6SZ","short_pith_number":"pith:KAZNXXG2","schema_version":"1.0","canonical_sha256":"5032dbdcdadbaaa67830927c5d38de965ecb57dfb6414955813d7edd8e43a300","source":{"kind":"arxiv","id":"cs/0612063","version":1},"attestation_state":"computed","paper":{"title":"Improving Precision of Type Analysis Using Non-Discriminative Union","license":"","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Lunjin Lu","submitted_at":"2006-12-12T03:09:44Z","abstract_excerpt":"This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed type "},"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":"cs/0612063","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2006-12-12T03:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"20c4d9e966b5d2af0dac088ec4480c56aefd5a30778547e899589a4be2326a3f","abstract_canon_sha256":"34030e78160b51a7ba8270205f34d8ab0ae7c65408f7b2cb43c477339efe9a95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:16.686218Z","signature_b64":"AAKRBYT1R+H6v0aC6REi8riSBiVNYQXIuhBf3tv38SurS6IMaB4yfV742rSpgqwbnw2V9sh60FmuuBqonXT3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5032dbdcdadbaaa67830927c5d38de965ecb57dfb6414955813d7edd8e43a300","last_reissued_at":"2026-05-18T04:33:16.685808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:16.685808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Precision of Type Analysis Using Non-Discriminative Union","license":"","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Lunjin Lu","submitted_at":"2006-12-12T03:09:44Z","abstract_excerpt":"This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed type "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0612063","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":"cs/0612063","created_at":"2026-05-18T04:33:16.685865+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0612063v1","created_at":"2026-05-18T04:33:16.685865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0612063","created_at":"2026-05-18T04:33:16.685865+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAZNXXG23OVK","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAZNXXG23OVKM6BQ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAZNXXG2","created_at":"2026-05-18T12:25:54.717736+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/KAZNXXG23OVKM6BQSJ6F2OG6SZ","json":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ.json","graph_json":"https://pith.science/api/pith-number/KAZNXXG23OVKM6BQSJ6F2OG6SZ/graph.json","events_json":"https://pith.science/api/pith-number/KAZNXXG23OVKM6BQSJ6F2OG6SZ/events.json","paper":"https://pith.science/paper/KAZNXXG2"},"agent_actions":{"view_html":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ","download_json":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ.json","view_paper":"https://pith.science/paper/KAZNXXG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0612063&json=true","fetch_graph":"https://pith.science/api/pith-number/KAZNXXG23OVKM6BQSJ6F2OG6SZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KAZNXXG23OVKM6BQSJ6F2OG6SZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ/action/storage_attestation","attest_author":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ/action/author_attestation","sign_citation":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ/action/citation_signature","submit_replication":"https://pith.science/pith/KAZNXXG23OVKM6BQSJ6F2OG6SZ/action/replication_record"}},"created_at":"2026-05-18T04:33:16.685865+00:00","updated_at":"2026-05-18T04:33:16.685865+00:00"}