{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3WRPMKYFLOCZGWCYKXZROPKPD6","short_pith_number":"pith:3WRPMKYF","schema_version":"1.0","canonical_sha256":"dda2f62b055b8593585855f3173d4f1f8149051aecaf82e8da2bcf9eddc31d41","source":{"kind":"arxiv","id":"1101.2770","version":1},"attestation_state":"computed","paper":{"title":"Robust Line Planning in case of Multiple Pools and Disruptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Apostolos Bessas, Christos Zaroliagis, Spyros Kontogiannis","submitted_at":"2011-01-14T11:04:13Z","abstract_excerpt":"We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools, when the line operators have a different utility function per pool. We conduct an experimental study of our mechanism on both synthetic and real-world data that shows fast convergence to the optimum. We also explore a wide range of scenarios, varying from an arbitrary initial state (to be solved) to small disruptions in a previously optimal solution (to be recovered). Our experiments with the latter scenario show tha"},"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":"1101.2770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-14T11:04:13Z","cross_cats_sorted":[],"title_canon_sha256":"0af3e9933fb0a2631724317b70975cd1486c1a7751c8c3dc026c9f777afc4850","abstract_canon_sha256":"94c162ed76f642d390066169a5478e50dd4e433dd9256c876db59eb11bcaf094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:40.032428Z","signature_b64":"kPG9aCmwVFwTvvq8UvaIcZaujWv4AnD6jolLEpjd+kUlakLOVFdK0hc3+/14ZjZ8XGu6tIJbYgYuKtOToEAsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dda2f62b055b8593585855f3173d4f1f8149051aecaf82e8da2bcf9eddc31d41","last_reissued_at":"2026-05-18T02:03:40.031994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:40.031994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Line Planning in case of Multiple Pools and Disruptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Apostolos Bessas, Christos Zaroliagis, Spyros Kontogiannis","submitted_at":"2011-01-14T11:04:13Z","abstract_excerpt":"We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools, when the line operators have a different utility function per pool. We conduct an experimental study of our mechanism on both synthetic and real-world data that shows fast convergence to the optimum. We also explore a wide range of scenarios, varying from an arbitrary initial state (to be solved) to small disruptions in a previously optimal solution (to be recovered). Our experiments with the latter scenario show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2770","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":"1101.2770","created_at":"2026-05-18T02:03:40.032061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2770v1","created_at":"2026-05-18T02:03:40.032061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2770","created_at":"2026-05-18T02:03:40.032061+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WRPMKYFLOCZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WRPMKYFLOCZGWCY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WRPMKYF","created_at":"2026-05-18T12:26:20.644004+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/3WRPMKYFLOCZGWCYKXZROPKPD6","json":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6.json","graph_json":"https://pith.science/api/pith-number/3WRPMKYFLOCZGWCYKXZROPKPD6/graph.json","events_json":"https://pith.science/api/pith-number/3WRPMKYFLOCZGWCYKXZROPKPD6/events.json","paper":"https://pith.science/paper/3WRPMKYF"},"agent_actions":{"view_html":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6","download_json":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6.json","view_paper":"https://pith.science/paper/3WRPMKYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2770&json=true","fetch_graph":"https://pith.science/api/pith-number/3WRPMKYFLOCZGWCYKXZROPKPD6/graph.json","fetch_events":"https://pith.science/api/pith-number/3WRPMKYFLOCZGWCYKXZROPKPD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6/action/storage_attestation","attest_author":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6/action/author_attestation","sign_citation":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6/action/citation_signature","submit_replication":"https://pith.science/pith/3WRPMKYFLOCZGWCYKXZROPKPD6/action/replication_record"}},"created_at":"2026-05-18T02:03:40.032061+00:00","updated_at":"2026-05-18T02:03:40.032061+00:00"}