{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SJD2UY6THDJ7Q43OBJLQEAN3XQ","short_pith_number":"pith:SJD2UY6T","schema_version":"1.0","canonical_sha256":"9247aa63d338d3f8736e0a570201bbbc3373d5ced92482464d73480ffa73022f","source":{"kind":"arxiv","id":"1410.3125","version":1},"attestation_state":"computed","paper":{"title":"Relational Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL","math.OC"],"primary_cat":"cs.AI","authors_text":"Kristian Kersting, Martin Mladenov, Pavel Tokmakov","submitted_at":"2014-10-12T18:06:07Z","abstract_excerpt":"We propose relational linear programming, a simple framework for combing linear programs (LPs) and logic programs. A relational linear program (RLP) is a declarative LP template defining the objective and the constraints through the logical concepts of objects, relations, and quantified variables. This allows one to express the LP objective and constraints relationally for a varying number of individuals and relations among them without enumerating them. Together with a logical knowledge base, effectively a logical program consisting of logical facts and rules, it induces a ground LP. This gro"},"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":"1410.3125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-12T18:06:07Z","cross_cats_sorted":["cs.LO","cs.PL","math.OC"],"title_canon_sha256":"dd812e08463e600a21406f789f0587744254ce9baaa3bdc661f864360692145d","abstract_canon_sha256":"477bcfc120ef55cb66f2be4b990485217f8e970c3bcecdba5a4b1b3688153d3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:16.971058Z","signature_b64":"MGDRQhpxhjZ6wSPV4yhSG0hpqVE95eiFiQ8U9dr2FpqNF2YeCUovu39t26oKrbhfnsCNqL1OZOP4fuw8d2jdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9247aa63d338d3f8736e0a570201bbbc3373d5ced92482464d73480ffa73022f","last_reissued_at":"2026-05-18T02:40:16.970119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:16.970119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relational Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL","math.OC"],"primary_cat":"cs.AI","authors_text":"Kristian Kersting, Martin Mladenov, Pavel Tokmakov","submitted_at":"2014-10-12T18:06:07Z","abstract_excerpt":"We propose relational linear programming, a simple framework for combing linear programs (LPs) and logic programs. A relational linear program (RLP) is a declarative LP template defining the objective and the constraints through the logical concepts of objects, relations, and quantified variables. This allows one to express the LP objective and constraints relationally for a varying number of individuals and relations among them without enumerating them. Together with a logical knowledge base, effectively a logical program consisting of logical facts and rules, it induces a ground LP. This gro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3125","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":"1410.3125","created_at":"2026-05-18T02:40:16.970193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3125v1","created_at":"2026-05-18T02:40:16.970193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3125","created_at":"2026-05-18T02:40:16.970193+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJD2UY6THDJ7","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJD2UY6THDJ7Q43O","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJD2UY6T","created_at":"2026-05-18T12:28:49.207871+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/SJD2UY6THDJ7Q43OBJLQEAN3XQ","json":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ.json","graph_json":"https://pith.science/api/pith-number/SJD2UY6THDJ7Q43OBJLQEAN3XQ/graph.json","events_json":"https://pith.science/api/pith-number/SJD2UY6THDJ7Q43OBJLQEAN3XQ/events.json","paper":"https://pith.science/paper/SJD2UY6T"},"agent_actions":{"view_html":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ","download_json":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ.json","view_paper":"https://pith.science/paper/SJD2UY6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3125&json=true","fetch_graph":"https://pith.science/api/pith-number/SJD2UY6THDJ7Q43OBJLQEAN3XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SJD2UY6THDJ7Q43OBJLQEAN3XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/action/storage_attestation","attest_author":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/action/author_attestation","sign_citation":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/action/citation_signature","submit_replication":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/action/replication_record"}},"created_at":"2026-05-18T02:40:16.970193+00:00","updated_at":"2026-05-18T02:40:16.970193+00:00"}