{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZM3VUBF6PAUDIIGUCVQAPOMAVA","short_pith_number":"pith:ZM3VUBF6","canonical_record":{"source":{"id":"1708.07932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-26T05:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"1ad56fbc0f80b26b3617343350db49b4c056c6e232a054dc85653d4276b87df2","abstract_canon_sha256":"cfb0443cbe87051dae48542bd376e3ccdea59bc145fa677fbad46172fa4bc26c"},"schema_version":"1.0"},"canonical_sha256":"cb375a04be78283420d4156007b980a82b8722fc364ea2c8113556ce090ad23e","source":{"kind":"arxiv","id":"1708.07932","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07932","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07932v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07932","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZM3VUBF6PAUD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZM3VUBF6PAUDIIGU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZM3VUBF6","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZM3VUBF6PAUDIIGUCVQAPOMAVA","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-26T05:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"1ad56fbc0f80b26b3617343350db49b4c056c6e232a054dc85653d4276b87df2","abstract_canon_sha256":"cfb0443cbe87051dae48542bd376e3ccdea59bc145fa677fbad46172fa4bc26c"},"schema_version":"1.0"},"canonical_sha256":"cb375a04be78283420d4156007b980a82b8722fc364ea2c8113556ce090ad23e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.602423Z","signature_b64":"wQ5DbAqjKwCepO6hBDrMQssnQz78CuOjBJT8neuRWvmWfL1N/laH3HlMVx6XvM8g8pe1VmDBlhQ4vReV2OLwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb375a04be78283420d4156007b980a82b8722fc364ea2c8113556ce090ad23e","last_reissued_at":"2026-05-18T00:36:37.601913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.601913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07932","source_version":1,"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-18T00:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keIZ0OO348c6d43UUNj6s1qMeRUzdsAaeokOXfr+JC08H0+IdXhdK+xNjpZusHDpKT5drJMyaELmhYDYBFQkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:08:48.830344Z"},"content_sha256":"3eab077480bc5cae9dd98be3906b3e5af12f4ee9b86100fd0687e1bcf665b415","schema_version":"1.0","event_id":"sha256:3eab077480bc5cae9dd98be3906b3e5af12f4ee9b86100fd0687e1bcf665b415"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZM3VUBF6PAUDIIGUCVQAPOMAVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm of Parking Planning for Smart Parking System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Feng Ha, Kui Zhao, Xuejian Zhao","submitted_at":"2017-08-26T05:26:39Z","abstract_excerpt":"There are so many vehicles in the world and the number of vehicles is increasing rapidly. To alleviate the parking problems caused by that, the smart parking system has been developed. The parking planning is one of the most important parts of it. An effective parking planning strategy makes the better use of parking resources possible. In this paper, we present a feasible method to do parking planning. We transform the parking planning problem into a kind of linear assignment problem. We take vehicles as jobs and parking spaces as agents. We take distances between vehicles and parking spaces "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07932","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"},"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-18T00:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrJd6ZnAIw5qNAPAeSCdMC2G/2Wq2bwrsXZzG2cFlPiHnlFgie8nnD8DK8mKxcpAVzbpjWDk6Q/oP62FVPgcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:08:48.830934Z"},"content_sha256":"6ac516715c982e9b00422edf0b1d6eab798f12088ba07b6c932904f711b9ad41","schema_version":"1.0","event_id":"sha256:6ac516715c982e9b00422edf0b1d6eab798f12088ba07b6c932904f711b9ad41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA/bundle.json","state_url":"https://pith.science/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA/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-06T08:08:48Z","links":{"resolver":"https://pith.science/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA","bundle":"https://pith.science/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA/bundle.json","state":"https://pith.science/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZM3VUBF6PAUDIIGUCVQAPOMAVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZM3VUBF6PAUDIIGUCVQAPOMAVA","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":"cfb0443cbe87051dae48542bd376e3ccdea59bc145fa677fbad46172fa4bc26c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-26T05:26:39Z","title_canon_sha256":"1ad56fbc0f80b26b3617343350db49b4c056c6e232a054dc85653d4276b87df2"},"schema_version":"1.0","source":{"id":"1708.07932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07932","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07932v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07932","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZM3VUBF6PAUD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZM3VUBF6PAUDIIGU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZM3VUBF6","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:6ac516715c982e9b00422edf0b1d6eab798f12088ba07b6c932904f711b9ad41","target":"graph","created_at":"2026-05-18T00:36:37Z","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":"There are so many vehicles in the world and the number of vehicles is increasing rapidly. To alleviate the parking problems caused by that, the smart parking system has been developed. The parking planning is one of the most important parts of it. An effective parking planning strategy makes the better use of parking resources possible. In this paper, we present a feasible method to do parking planning. We transform the parking planning problem into a kind of linear assignment problem. We take vehicles as jobs and parking spaces as agents. We take distances between vehicles and parking spaces ","authors_text":"Feng Ha, Kui Zhao, Xuejian Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-26T05:26:39Z","title":"An Algorithm of Parking Planning for Smart Parking System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07932","kind":"arxiv","version":1},"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:3eab077480bc5cae9dd98be3906b3e5af12f4ee9b86100fd0687e1bcf665b415","target":"record","created_at":"2026-05-18T00:36:37Z","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":"cfb0443cbe87051dae48542bd376e3ccdea59bc145fa677fbad46172fa4bc26c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-26T05:26:39Z","title_canon_sha256":"1ad56fbc0f80b26b3617343350db49b4c056c6e232a054dc85653d4276b87df2"},"schema_version":"1.0","source":{"id":"1708.07932","kind":"arxiv","version":1}},"canonical_sha256":"cb375a04be78283420d4156007b980a82b8722fc364ea2c8113556ce090ad23e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb375a04be78283420d4156007b980a82b8722fc364ea2c8113556ce090ad23e","first_computed_at":"2026-05-18T00:36:37.601913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:37.601913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wQ5DbAqjKwCepO6hBDrMQssnQz78CuOjBJT8neuRWvmWfL1N/laH3HlMVx6XvM8g8pe1VmDBlhQ4vReV2OLwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:37.602423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eab077480bc5cae9dd98be3906b3e5af12f4ee9b86100fd0687e1bcf665b415","sha256:6ac516715c982e9b00422edf0b1d6eab798f12088ba07b6c932904f711b9ad41"],"state_sha256":"ee9bbdedb670e3c214bd94a4af5141d6b6868821624a989bdb9a4d458237b2a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPYGVkNJt5fnYTHBNpKlwuU1lBRQL5LTrdR3D8PZzAsza0ZJ0Ms7ZdF68ieUdV9LvUbkOuHJ35JxY3gn3YabDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:08:48.834569Z","bundle_sha256":"0e6361d4cc8bda043bf278baf00119b1f24c921803e58dcf6dc532cc79e6f687"}}