{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CMSPPCSGJ7XS4WORRKWWVNPJ66","short_pith_number":"pith:CMSPPCSG","schema_version":"1.0","canonical_sha256":"1324f78a464fef2e59d18aad6ab5e9f78f6c155be280694e918308b018c70151","source":{"kind":"arxiv","id":"1205.3757","version":2},"attestation_state":"computed","paper":{"title":"A reduced integer programming model for the ferry scheduling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Abraham P. Punnen, Daniel Karapetyan","submitted_at":"2012-05-16T18:49:29Z","abstract_excerpt":"We present an integer programming model for the ferry scheduling problem, improving existing models in various ways. In particular, our model has reduced size in terms of the number of variables and constraints compared to existing models by a factor of approximately O(n), where n being the number of ports. The model also handles efficiently load/unload time constraints, crew scheduling and passenger transfers. Experiments using real world data produced high quality solutions in 12 hours using CPLEX 12.4 with a performance guarantee of within 15% of optimality, on average. This establishes 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":"1205.3757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-16T18:49:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7642a719d67954c2f5eb209a909fe1b9b6502bf60f22b686c30d869d6935baf3","abstract_canon_sha256":"5c9ed845c47a365bbde9855eabfe39b833900e84d655f48a8f03a2cac062fd9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.832559Z","signature_b64":"OZ6sEP91xHCT4I73GAMguzA0GQHbLq7WRnVz+dHAR+9RkvXfeNCuUuFj9JFm7/83RFFGWOZPW3Z/c3Ls1lm+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1324f78a464fef2e59d18aad6ab5e9f78f6c155be280694e918308b018c70151","last_reissued_at":"2026-05-18T02:30:08.832135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.832135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A reduced integer programming model for the ferry scheduling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Abraham P. Punnen, Daniel Karapetyan","submitted_at":"2012-05-16T18:49:29Z","abstract_excerpt":"We present an integer programming model for the ferry scheduling problem, improving existing models in various ways. In particular, our model has reduced size in terms of the number of variables and constraints compared to existing models by a factor of approximately O(n), where n being the number of ports. The model also handles efficiently load/unload time constraints, crew scheduling and passenger transfers. Experiments using real world data produced high quality solutions in 12 hours using CPLEX 12.4 with a performance guarantee of within 15% of optimality, on average. This establishes tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3757","kind":"arxiv","version":2},"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":"1205.3757","created_at":"2026-05-18T02:30:08.832199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3757v2","created_at":"2026-05-18T02:30:08.832199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3757","created_at":"2026-05-18T02:30:08.832199+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMSPPCSGJ7XS","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMSPPCSGJ7XS4WOR","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMSPPCSG","created_at":"2026-05-18T12:27:01.376967+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/CMSPPCSGJ7XS4WORRKWWVNPJ66","json":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66.json","graph_json":"https://pith.science/api/pith-number/CMSPPCSGJ7XS4WORRKWWVNPJ66/graph.json","events_json":"https://pith.science/api/pith-number/CMSPPCSGJ7XS4WORRKWWVNPJ66/events.json","paper":"https://pith.science/paper/CMSPPCSG"},"agent_actions":{"view_html":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66","download_json":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66.json","view_paper":"https://pith.science/paper/CMSPPCSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3757&json=true","fetch_graph":"https://pith.science/api/pith-number/CMSPPCSGJ7XS4WORRKWWVNPJ66/graph.json","fetch_events":"https://pith.science/api/pith-number/CMSPPCSGJ7XS4WORRKWWVNPJ66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/action/storage_attestation","attest_author":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/action/author_attestation","sign_citation":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/action/citation_signature","submit_replication":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/action/replication_record"}},"created_at":"2026-05-18T02:30:08.832199+00:00","updated_at":"2026-05-18T02:30:08.832199+00:00"}