{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SEGW4XWQPTKVYAMV26AHVPF6DG","short_pith_number":"pith:SEGW4XWQ","schema_version":"1.0","canonical_sha256":"910d6e5ed07cd55c0195d7807abcbe1990f8d47c9242a40a26ae14af8ec06f8e","source":{"kind":"arxiv","id":"2607.11980","version":1},"attestation_state":"computed","paper":{"title":"LP Mining with LP2Graph: A Use Case for Railway Rescheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"J\\\"orn Maurischat, Michael F\\\"arber, Nikola Be\\v{s}inovi\\'c","submitted_at":"2026-07-13T07:25:02Z","abstract_excerpt":"Like many optimization-driven domains, railway rescheduling relies on Mixed-Integer Linear Programming (MILP), yet the field's modeling knowledge is scattered across hundreds of papers in incompatible notations, and narrative surveys organize it subjectively: they classify models by vocabulary rather than by structure, and reproduce neither. We present LP Mining with LP2Graph, a method that mines the structure of published LP and MILP formulations into a reproducible dataset and an induced taxonomy. Its core, LP2Graph, represents each formulation admitted by its canonical grammar as a typed va"},"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":"2607.11980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-13T07:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"5fe8907f1e5ddeaaa5485a92f2935f36fdd57eaa0713a978baded9b7b5a73fb4","abstract_canon_sha256":"b519788274d9108de951a056c0000f5b973e8a302e5d4275dcf093efa9ace83f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T00:21:25.851681Z","signature_b64":"LdWLosVT3bNnuJs4P68775pMTTQk78FECD/zvgFMBZP/aiuWGwmpJoEsqT5rg+i7y+S2APybmSTaojlmvDSLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910d6e5ed07cd55c0195d7807abcbe1990f8d47c9242a40a26ae14af8ec06f8e","last_reissued_at":"2026-07-15T00:21:25.850884Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T00:21:25.850884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LP Mining with LP2Graph: A Use Case for Railway Rescheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"J\\\"orn Maurischat, Michael F\\\"arber, Nikola Be\\v{s}inovi\\'c","submitted_at":"2026-07-13T07:25:02Z","abstract_excerpt":"Like many optimization-driven domains, railway rescheduling relies on Mixed-Integer Linear Programming (MILP), yet the field's modeling knowledge is scattered across hundreds of papers in incompatible notations, and narrative surveys organize it subjectively: they classify models by vocabulary rather than by structure, and reproduce neither. We present LP Mining with LP2Graph, a method that mines the structure of published LP and MILP formulations into a reproducible dataset and an induced taxonomy. Its core, LP2Graph, represents each formulation admitted by its canonical grammar as a typed va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11980","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.11980/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.11980","created_at":"2026-07-15T00:21:25.851306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11980v1","created_at":"2026-07-15T00:21:25.851306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11980","created_at":"2026-07-15T00:21:25.851306+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEGW4XWQPTKV","created_at":"2026-07-15T00:21:25.851306+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEGW4XWQPTKVYAMV","created_at":"2026-07-15T00:21:25.851306+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEGW4XWQ","created_at":"2026-07-15T00:21:25.851306+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/SEGW4XWQPTKVYAMV26AHVPF6DG","json":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG.json","graph_json":"https://pith.science/api/pith-number/SEGW4XWQPTKVYAMV26AHVPF6DG/graph.json","events_json":"https://pith.science/api/pith-number/SEGW4XWQPTKVYAMV26AHVPF6DG/events.json","paper":"https://pith.science/paper/SEGW4XWQ"},"agent_actions":{"view_html":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG","download_json":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG.json","view_paper":"https://pith.science/paper/SEGW4XWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11980&json=true","fetch_graph":"https://pith.science/api/pith-number/SEGW4XWQPTKVYAMV26AHVPF6DG/graph.json","fetch_events":"https://pith.science/api/pith-number/SEGW4XWQPTKVYAMV26AHVPF6DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG/action/storage_attestation","attest_author":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG/action/author_attestation","sign_citation":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG/action/citation_signature","submit_replication":"https://pith.science/pith/SEGW4XWQPTKVYAMV26AHVPF6DG/action/replication_record"}},"created_at":"2026-07-15T00:21:25.851306+00:00","updated_at":"2026-07-15T00:21:25.851306+00:00"}