{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SJD2UY6THDJ7Q43OBJLQEAN3XQ","short_pith_number":"pith:SJD2UY6T","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"},"canonical_sha256":"9247aa63d338d3f8736e0a570201bbbc3373d5ced92482464d73480ffa73022f","source":{"kind":"arxiv","id":"1410.3125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3125","created_at":"2026-05-18T02:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3125v1","created_at":"2026-05-18T02:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3125","created_at":"2026-05-18T02:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"SJD2UY6THDJ7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SJD2UY6THDJ7Q43O","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SJD2UY6T","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SJD2UY6THDJ7Q43OBJLQEAN3XQ","target":"record","payload":{"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"},"canonical_sha256":"9247aa63d338d3f8736e0a570201bbbc3373d5ced92482464d73480ffa73022f","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"},"source_kind":"arxiv","source_id":"1410.3125","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-18T02:40:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpCBhe7pLAHyqv6LiPpi0OLtT3D56sSTJfqJLV6pF0WEbmNzUkCyUoH+g8J3I62hLJWPF3H5HqVWYHmWUadvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:31:40.000485Z"},"content_sha256":"d6d6e2a87197ba10ccae370898fd796f34630919f5bc3eeba42551cd2c761e68","schema_version":"1.0","event_id":"sha256:d6d6e2a87197ba10ccae370898fd796f34630919f5bc3eeba42551cd2c761e68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SJD2UY6THDJ7Q43OBJLQEAN3XQ","target":"graph","payload":{"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"},"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-18T02:40:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0DuoPxIxd/BdFF5ML4mCsGJ/C+3NHnnU77GTODvPWOIe62QJJ7wR8QAYdHwLjQ/0fWdE1pBwIMKwdSUwahyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:31:40.001137Z"},"content_sha256":"38a82ba8beaf4f92533dea188e85193814c214424cfc85676b293744f52ea607","schema_version":"1.0","event_id":"sha256:38a82ba8beaf4f92533dea188e85193814c214424cfc85676b293744f52ea607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/bundle.json","state_url":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/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-27T23:31:40Z","links":{"resolver":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ","bundle":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/bundle.json","state":"https://pith.science/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJD2UY6THDJ7Q43OBJLQEAN3XQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SJD2UY6THDJ7Q43OBJLQEAN3XQ","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":"477bcfc120ef55cb66f2be4b990485217f8e970c3bcecdba5a4b1b3688153d3f","cross_cats_sorted":["cs.LO","cs.PL","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-12T18:06:07Z","title_canon_sha256":"dd812e08463e600a21406f789f0587744254ce9baaa3bdc661f864360692145d"},"schema_version":"1.0","source":{"id":"1410.3125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3125","created_at":"2026-05-18T02:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3125v1","created_at":"2026-05-18T02:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3125","created_at":"2026-05-18T02:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"SJD2UY6THDJ7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SJD2UY6THDJ7Q43O","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SJD2UY6T","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:38a82ba8beaf4f92533dea188e85193814c214424cfc85676b293744f52ea607","target":"graph","created_at":"2026-05-18T02:40:16Z","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":"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","authors_text":"Kristian Kersting, Martin Mladenov, Pavel Tokmakov","cross_cats":["cs.LO","cs.PL","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-12T18:06:07Z","title":"Relational Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3125","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:d6d6e2a87197ba10ccae370898fd796f34630919f5bc3eeba42551cd2c761e68","target":"record","created_at":"2026-05-18T02:40:16Z","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":"477bcfc120ef55cb66f2be4b990485217f8e970c3bcecdba5a4b1b3688153d3f","cross_cats_sorted":["cs.LO","cs.PL","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-12T18:06:07Z","title_canon_sha256":"dd812e08463e600a21406f789f0587744254ce9baaa3bdc661f864360692145d"},"schema_version":"1.0","source":{"id":"1410.3125","kind":"arxiv","version":1}},"canonical_sha256":"9247aa63d338d3f8736e0a570201bbbc3373d5ced92482464d73480ffa73022f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9247aa63d338d3f8736e0a570201bbbc3373d5ced92482464d73480ffa73022f","first_computed_at":"2026-05-18T02:40:16.970119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:16.970119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGDRQhpxhjZ6wSPV4yhSG0hpqVE95eiFiQ8U9dr2FpqNF2YeCUovu39t26oKrbhfnsCNqL1OZOP4fuw8d2jdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:16.971058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d6e2a87197ba10ccae370898fd796f34630919f5bc3eeba42551cd2c761e68","sha256:38a82ba8beaf4f92533dea188e85193814c214424cfc85676b293744f52ea607"],"state_sha256":"255ace54e584d533e67dd1af29e15f1286027aa9abd3230a881c788b16eb8b91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdM2JtSWlcCXUFW1a7qdEWNA3L6iM+va9t+QGVIh8Nna9xEpPTHGvsXKMSG52w7fS4qofvk7bx3R2Al3lpiNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:31:40.003866Z","bundle_sha256":"76ddbb817959f44331d447c266eb5bb3dc79d0efd3c0d486a1bfb16c02b49b28"}}