{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5ZJARRQUTUHJR53EA6OXYSNWQQ","short_pith_number":"pith:5ZJARRQU","schema_version":"1.0","canonical_sha256":"ee5208c6149d0e98f764079d7c49b6841eeaa722a48bcc9e5dcd0203e1567045","source":{"kind":"arxiv","id":"1605.00702","version":2},"attestation_state":"computed","paper":{"title":"A heuristic algorithm for a single vehicle static bike sharing rebalancing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand Subramanian, Bruno P. Bruck, F\\'abio Cruz, Manuel Iori","submitted_at":"2016-05-02T22:44:54Z","abstract_excerpt":"The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among stations in self-service bike-sharing systems. This problem can be seen as a variant of the one-commodity pickup and delivery vehicle routing problem, where multiple visits are allowed to be performed at each station, i.e., the demand of a station is allowed to be split. Moreover, a vehicle may temporarily drop its load at a station, leaving it in excess or, alternatively, collect more bikes from a station (even all of them), thus leaving it in default. Both cases require further visits in order to meet t"},"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":"1605.00702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-02T22:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"f36419ba12ee412e5684f74b371b347fd16555a81e5a1d8473def8de4f8d0091","abstract_canon_sha256":"8de11053efc83792f08621f67dc7248c85cc9db643e592b2e9a11c81257e5830"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:38.037200Z","signature_b64":"uSvVnAlkqCNFlMhWlzaD/5gkdAUv0dN8rufpDMSIuny5z4dT7mjQ5BpvnTViw2Xjn/xdx6gCUWAE0GOe1wDbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5208c6149d0e98f764079d7c49b6841eeaa722a48bcc9e5dcd0203e1567045","last_reissued_at":"2026-05-18T01:15:38.036531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:38.036531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A heuristic algorithm for a single vehicle static bike sharing rebalancing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand Subramanian, Bruno P. Bruck, F\\'abio Cruz, Manuel Iori","submitted_at":"2016-05-02T22:44:54Z","abstract_excerpt":"The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among stations in self-service bike-sharing systems. This problem can be seen as a variant of the one-commodity pickup and delivery vehicle routing problem, where multiple visits are allowed to be performed at each station, i.e., the demand of a station is allowed to be split. Moreover, a vehicle may temporarily drop its load at a station, leaving it in excess or, alternatively, collect more bikes from a station (even all of them), thus leaving it in default. Both cases require further visits in order to meet t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00702","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":"1605.00702","created_at":"2026-05-18T01:15:38.036642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00702v2","created_at":"2026-05-18T01:15:38.036642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00702","created_at":"2026-05-18T01:15:38.036642+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZJARRQUTUHJ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZJARRQUTUHJR53E","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZJARRQU","created_at":"2026-05-18T12:30:01.593930+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/5ZJARRQUTUHJR53EA6OXYSNWQQ","json":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ.json","graph_json":"https://pith.science/api/pith-number/5ZJARRQUTUHJR53EA6OXYSNWQQ/graph.json","events_json":"https://pith.science/api/pith-number/5ZJARRQUTUHJR53EA6OXYSNWQQ/events.json","paper":"https://pith.science/paper/5ZJARRQU"},"agent_actions":{"view_html":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ","download_json":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ.json","view_paper":"https://pith.science/paper/5ZJARRQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00702&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZJARRQUTUHJR53EA6OXYSNWQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZJARRQUTUHJR53EA6OXYSNWQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ/action/storage_attestation","attest_author":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ/action/author_attestation","sign_citation":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ/action/citation_signature","submit_replication":"https://pith.science/pith/5ZJARRQUTUHJR53EA6OXYSNWQQ/action/replication_record"}},"created_at":"2026-05-18T01:15:38.036642+00:00","updated_at":"2026-05-18T01:15:38.036642+00:00"}