{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CMSPPCSGJ7XS4WORRKWWVNPJ66","short_pith_number":"pith:CMSPPCSG","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"},"canonical_sha256":"1324f78a464fef2e59d18aad6ab5e9f78f6c155be280694e918308b018c70151","source":{"kind":"arxiv","id":"1205.3757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3757","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3757v2","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3757","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"CMSPPCSGJ7XS","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CMSPPCSGJ7XS4WOR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CMSPPCSG","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CMSPPCSGJ7XS4WORRKWWVNPJ66","target":"record","payload":{"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"},"canonical_sha256":"1324f78a464fef2e59d18aad6ab5e9f78f6c155be280694e918308b018c70151","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"},"source_kind":"arxiv","source_id":"1205.3757","source_version":2,"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6OkHkZBAixoPems/a6+hy3yrWHtUJl5k6rrzbLLvbEt1zfrhPNliyCIarbNeA4ZLvQj4pEZs1HGBuglB7tZmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:04:26.475679Z"},"content_sha256":"eef01146c90a2b756ad822c24610127dc1c4e7341be5dbe45ce5738319130334","schema_version":"1.0","event_id":"sha256:eef01146c90a2b756ad822c24610127dc1c4e7341be5dbe45ce5738319130334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CMSPPCSGJ7XS4WORRKWWVNPJ66","target":"graph","payload":{"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"},"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:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwhJYlzWHLICX+/32WyXWk7tU7aqpycLUg8Xx3R8JbmhKu7ZpAKNeKW7VXMINFs3qSs38cYlazdY3QkIpcBaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:04:26.476039Z"},"content_sha256":"155706260d98626808dadd00c539ab89b68f54bce5803059821251d2ed87ebdf","schema_version":"1.0","event_id":"sha256:155706260d98626808dadd00c539ab89b68f54bce5803059821251d2ed87ebdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/bundle.json","state_url":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/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-06-05T14:04:26Z","links":{"resolver":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66","bundle":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/bundle.json","state":"https://pith.science/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMSPPCSGJ7XS4WORRKWWVNPJ66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CMSPPCSGJ7XS4WORRKWWVNPJ66","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":"5c9ed845c47a365bbde9855eabfe39b833900e84d655f48a8f03a2cac062fd9f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-16T18:49:29Z","title_canon_sha256":"7642a719d67954c2f5eb209a909fe1b9b6502bf60f22b686c30d869d6935baf3"},"schema_version":"1.0","source":{"id":"1205.3757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3757","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3757v2","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3757","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"CMSPPCSGJ7XS","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CMSPPCSGJ7XS4WOR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CMSPPCSG","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:155706260d98626808dadd00c539ab89b68f54bce5803059821251d2ed87ebdf","target":"graph","created_at":"2026-05-18T02:30:08Z","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 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","authors_text":"Abraham P. Punnen, Daniel Karapetyan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-16T18:49:29Z","title":"A reduced integer programming model for the ferry scheduling problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3757","kind":"arxiv","version":2},"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:eef01146c90a2b756ad822c24610127dc1c4e7341be5dbe45ce5738319130334","target":"record","created_at":"2026-05-18T02:30:08Z","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":"5c9ed845c47a365bbde9855eabfe39b833900e84d655f48a8f03a2cac062fd9f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-16T18:49:29Z","title_canon_sha256":"7642a719d67954c2f5eb209a909fe1b9b6502bf60f22b686c30d869d6935baf3"},"schema_version":"1.0","source":{"id":"1205.3757","kind":"arxiv","version":2}},"canonical_sha256":"1324f78a464fef2e59d18aad6ab5e9f78f6c155be280694e918308b018c70151","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1324f78a464fef2e59d18aad6ab5e9f78f6c155be280694e918308b018c70151","first_computed_at":"2026-05-18T02:30:08.832135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:08.832135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OZ6sEP91xHCT4I73GAMguzA0GQHbLq7WRnVz+dHAR+9RkvXfeNCuUuFj9JFm7/83RFFGWOZPW3Z/c3Ls1lm+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:08.832559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eef01146c90a2b756ad822c24610127dc1c4e7341be5dbe45ce5738319130334","sha256:155706260d98626808dadd00c539ab89b68f54bce5803059821251d2ed87ebdf"],"state_sha256":"e7a729745b5f2095f7249b8dcefb16d1fb502765cdcb86906e01bf599cab6d11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4wWI77x/o4V+3S3EX77WW50M4/qAxWR9X5JfmOahhrYhE7kNdJRplBi3OtattOo7UrpS4dGgBF/BYz0Y/3FAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:04:26.478154Z","bundle_sha256":"e416d9e69967ec91a3005b338863bca281c6a91892ffec91069f892ccbd8a7ef"}}