{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ON5VFVUGE6EI6HTL2KUWYEBGMJ","short_pith_number":"pith:ON5VFVUG","schema_version":"1.0","canonical_sha256":"737b52d68627888f1e6bd2a96c1026624ba58d8263104cb99b3cca8979442879","source":{"kind":"arxiv","id":"1707.07551","version":1},"attestation_state":"computed","paper":{"title":"A Nonlinear Solution to Closed Queueing Networks for Bike Sharing Systems with Markovian Arrival Processes and under an Irreducible Path Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Quan-Lin Li, Rui-Na Fan, Zhi-Yong Qian","submitted_at":"2017-07-21T10:11:10Z","abstract_excerpt":"As a favorite urban public transport mode, the bike sharing system is a large-scale and complicated system, and there exists a key requirement that a user and a bike should be matched sufficiently in time. Such matched behavior makes analysis of the bike sharing systems more difficult and challenging. This paper considers a more general large-scale bike sharing system from two important views: (a) Bikes move in an irreducible path graph, which is related to geographical structure of the bike sharing system; and (b) Markovian arrival processes (MAPs) are applied to describe the non-Poisson and "},"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":"1707.07551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-21T10:11:10Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"448571f322e0b726bd69944adc5d233dea319f6d35ee7510b959db5eac2adab8","abstract_canon_sha256":"db5aeef4fa4633c209c69ece56e398a3c36ab219604bbf2b7d56cf8106d8290c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:41.899263Z","signature_b64":"X1W9A4clb9HpXtT2z0IuAR20uv7auNNvDNQlAJJm4/2PuFAu/DEK+eMdBRRqeL02KCivobwYLz3vbxBbr943Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737b52d68627888f1e6bd2a96c1026624ba58d8263104cb99b3cca8979442879","last_reissued_at":"2026-05-18T00:39:41.898627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:41.898627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nonlinear Solution to Closed Queueing Networks for Bike Sharing Systems with Markovian Arrival Processes and under an Irreducible Path Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Quan-Lin Li, Rui-Na Fan, Zhi-Yong Qian","submitted_at":"2017-07-21T10:11:10Z","abstract_excerpt":"As a favorite urban public transport mode, the bike sharing system is a large-scale and complicated system, and there exists a key requirement that a user and a bike should be matched sufficiently in time. Such matched behavior makes analysis of the bike sharing systems more difficult and challenging. This paper considers a more general large-scale bike sharing system from two important views: (a) Bikes move in an irreducible path graph, which is related to geographical structure of the bike sharing system; and (b) Markovian arrival processes (MAPs) are applied to describe the non-Poisson and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07551","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":"1707.07551","created_at":"2026-05-18T00:39:41.898731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07551v1","created_at":"2026-05-18T00:39:41.898731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07551","created_at":"2026-05-18T00:39:41.898731+00:00"},{"alias_kind":"pith_short_12","alias_value":"ON5VFVUGE6EI","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ON5VFVUGE6EI6HTL","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ON5VFVUG","created_at":"2026-05-18T12:31:34.259226+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/ON5VFVUGE6EI6HTL2KUWYEBGMJ","json":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ.json","graph_json":"https://pith.science/api/pith-number/ON5VFVUGE6EI6HTL2KUWYEBGMJ/graph.json","events_json":"https://pith.science/api/pith-number/ON5VFVUGE6EI6HTL2KUWYEBGMJ/events.json","paper":"https://pith.science/paper/ON5VFVUG"},"agent_actions":{"view_html":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ","download_json":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ.json","view_paper":"https://pith.science/paper/ON5VFVUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07551&json=true","fetch_graph":"https://pith.science/api/pith-number/ON5VFVUGE6EI6HTL2KUWYEBGMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ON5VFVUGE6EI6HTL2KUWYEBGMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ/action/storage_attestation","attest_author":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ/action/author_attestation","sign_citation":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ/action/citation_signature","submit_replication":"https://pith.science/pith/ON5VFVUGE6EI6HTL2KUWYEBGMJ/action/replication_record"}},"created_at":"2026-05-18T00:39:41.898731+00:00","updated_at":"2026-05-18T00:39:41.898731+00:00"}