{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UPXRTHUQ4DYPQWBEFZ5RRUUQR6","short_pith_number":"pith:UPXRTHUQ","schema_version":"1.0","canonical_sha256":"a3ef199e90e0f0f858242e7b18d2908faa7d030346b8e649034e9fe989f802eb","source":{"kind":"arxiv","id":"1512.06943","version":1},"attestation_state":"computed","paper":{"title":"Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Salvador Lucas (DSIC, Spain), Universitat Polit\\`ecnica de Val\\`encia","submitted_at":"2015-12-22T03:16:34Z","abstract_excerpt":"Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis"},"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":"1512.06943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-12-22T03:16:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"efdeb7ba6ded675376244acaae98d659cd5bf268988ef18f187cc423878bbef2","abstract_canon_sha256":"cbae9f9dd44bb8cef9514e0715f56c3068ae6dcd6d7e79f8cd405a64ce053137"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:53.394834Z","signature_b64":"/E7QrpS7za0OSkxKXk2Rrok0C+dwNOPDkCdW7VCn4f6E8v/BxqOvZwJIzOD7cuGkCJ2jIUPfLszm0Kul2ZKBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ef199e90e0f0f858242e7b18d2908faa7d030346b8e649034e9fe989f802eb","last_reissued_at":"2026-05-18T01:23:53.394239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:53.394239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Salvador Lucas (DSIC, Spain), Universitat Polit\\`ecnica de Val\\`encia","submitted_at":"2015-12-22T03:16:34Z","abstract_excerpt":"Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06943","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":"1512.06943","created_at":"2026-05-18T01:23:53.394364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06943v1","created_at":"2026-05-18T01:23:53.394364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06943","created_at":"2026-05-18T01:23:53.394364+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPXRTHUQ4DYP","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPXRTHUQ4DYPQWBE","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPXRTHUQ","created_at":"2026-05-18T12:29:44.643036+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/UPXRTHUQ4DYPQWBEFZ5RRUUQR6","json":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6.json","graph_json":"https://pith.science/api/pith-number/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/graph.json","events_json":"https://pith.science/api/pith-number/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/events.json","paper":"https://pith.science/paper/UPXRTHUQ"},"agent_actions":{"view_html":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6","download_json":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6.json","view_paper":"https://pith.science/paper/UPXRTHUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06943&json=true","fetch_graph":"https://pith.science/api/pith-number/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/graph.json","fetch_events":"https://pith.science/api/pith-number/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/action/storage_attestation","attest_author":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/action/author_attestation","sign_citation":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/action/citation_signature","submit_replication":"https://pith.science/pith/UPXRTHUQ4DYPQWBEFZ5RRUUQR6/action/replication_record"}},"created_at":"2026-05-18T01:23:53.394364+00:00","updated_at":"2026-05-18T01:23:53.394364+00:00"}