{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:52HT4B7W4ZVRC4S6T5B6UATMNA","short_pith_number":"pith:52HT4B7W","canonical_record":{"source":{"id":"1709.07485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T18:40:02Z","cross_cats_sorted":[],"title_canon_sha256":"1c9081bbc2b5e1f4200bade761eed4275058f74f97a0f86e92745946b58446a2","abstract_canon_sha256":"7ef4d463d1c9fec2e02b98c792410f941f013a6219a1bcb09ffbe35c1dba66cf"},"schema_version":"1.0"},"canonical_sha256":"ee8f3e07f6e66b11725e9f43ea026c681349206ee7057415f6c15fe7d6ac122c","source":{"kind":"arxiv","id":"1709.07485","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07485","created_at":"2026-05-17T23:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07485v2","created_at":"2026-05-17T23:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07485","created_at":"2026-05-17T23:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"52HT4B7W4ZVR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"52HT4B7W4ZVRC4S6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"52HT4B7W","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:52HT4B7W4ZVRC4S6T5B6UATMNA","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T18:40:02Z","cross_cats_sorted":[],"title_canon_sha256":"1c9081bbc2b5e1f4200bade761eed4275058f74f97a0f86e92745946b58446a2","abstract_canon_sha256":"7ef4d463d1c9fec2e02b98c792410f941f013a6219a1bcb09ffbe35c1dba66cf"},"schema_version":"1.0"},"canonical_sha256":"ee8f3e07f6e66b11725e9f43ea026c681349206ee7057415f6c15fe7d6ac122c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:49.233345Z","signature_b64":"U8w4FGTcU+TdWTZQIDNskrBiN9oGG8GWg3mBmTA9ITaEso3e+zCbXbZ4xWNMwReuxWyvVFUdMbxq/unysn2CDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee8f3e07f6e66b11725e9f43ea026c681349206ee7057415f6c15fe7d6ac122c","last_reissued_at":"2026-05-17T23:47:49.232567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:49.232567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07485","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-17T23:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUmi58Y4m6ytr1IfAnPqbaUTW7Ocy9+A8r881nc/dl/0Rs0gSr7e0RPurXcRr4ojUNJyceMEDIhzkLJI80nwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:25:10.030582Z"},"content_sha256":"ff26c96e8b8d532299b7e4a5cce9faf2385c2482e48173abcd23e1897df17650","schema_version":"1.0","event_id":"sha256:ff26c96e8b8d532299b7e4a5cce9faf2385c2482e48173abcd23e1897df17650"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:52HT4B7W4ZVRC4S6T5B6UATMNA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Covering Path Problem on a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Karen Smilowitz, Liwei Zeng, Sunil Chopra","submitted_at":"2017-09-21T18:40:02Z","abstract_excerpt":"This paper introduces the covering path problem on a grid (CPPG) which finds the cost-minimizing path connecting a subset of points in a grid such that each point that needs to be covered is within a predetermined distance of a point from the chosen subset. We leverage the geometric properties of the grid graph which captures the road network structure in many transportation problems, including our motivating setting of school bus routing. As defined in this paper, the CPPG is a bi-objective optimization problem comprised of one cost term related to path length and one cost term related to sto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07485","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-17T23:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgQ6d42FCb/MOAGleOLtIXgZGRf0p1kEPWxXmYlnbxiHv3cfJ5xZOQjwh2HHFlKjD1fbl3PdFV6YFu/kOq52DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:25:10.031392Z"},"content_sha256":"a8e935b54014d9a2de2f11f6b2ad1aa241c6982c960d4dbc32ac3d26d2efb6ce","schema_version":"1.0","event_id":"sha256:a8e935b54014d9a2de2f11f6b2ad1aa241c6982c960d4dbc32ac3d26d2efb6ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52HT4B7W4ZVRC4S6T5B6UATMNA/bundle.json","state_url":"https://pith.science/pith/52HT4B7W4ZVRC4S6T5B6UATMNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52HT4B7W4ZVRC4S6T5B6UATMNA/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-05-31T19:25:10Z","links":{"resolver":"https://pith.science/pith/52HT4B7W4ZVRC4S6T5B6UATMNA","bundle":"https://pith.science/pith/52HT4B7W4ZVRC4S6T5B6UATMNA/bundle.json","state":"https://pith.science/pith/52HT4B7W4ZVRC4S6T5B6UATMNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52HT4B7W4ZVRC4S6T5B6UATMNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:52HT4B7W4ZVRC4S6T5B6UATMNA","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":"7ef4d463d1c9fec2e02b98c792410f941f013a6219a1bcb09ffbe35c1dba66cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T18:40:02Z","title_canon_sha256":"1c9081bbc2b5e1f4200bade761eed4275058f74f97a0f86e92745946b58446a2"},"schema_version":"1.0","source":{"id":"1709.07485","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07485","created_at":"2026-05-17T23:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07485v2","created_at":"2026-05-17T23:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07485","created_at":"2026-05-17T23:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"52HT4B7W4ZVR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"52HT4B7W4ZVRC4S6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"52HT4B7W","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:a8e935b54014d9a2de2f11f6b2ad1aa241c6982c960d4dbc32ac3d26d2efb6ce","target":"graph","created_at":"2026-05-17T23:47:49Z","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":"This paper introduces the covering path problem on a grid (CPPG) which finds the cost-minimizing path connecting a subset of points in a grid such that each point that needs to be covered is within a predetermined distance of a point from the chosen subset. We leverage the geometric properties of the grid graph which captures the road network structure in many transportation problems, including our motivating setting of school bus routing. As defined in this paper, the CPPG is a bi-objective optimization problem comprised of one cost term related to path length and one cost term related to sto","authors_text":"Karen Smilowitz, Liwei Zeng, Sunil Chopra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T18:40:02Z","title":"The Covering Path Problem on a Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07485","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:ff26c96e8b8d532299b7e4a5cce9faf2385c2482e48173abcd23e1897df17650","target":"record","created_at":"2026-05-17T23:47:49Z","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":"7ef4d463d1c9fec2e02b98c792410f941f013a6219a1bcb09ffbe35c1dba66cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T18:40:02Z","title_canon_sha256":"1c9081bbc2b5e1f4200bade761eed4275058f74f97a0f86e92745946b58446a2"},"schema_version":"1.0","source":{"id":"1709.07485","kind":"arxiv","version":2}},"canonical_sha256":"ee8f3e07f6e66b11725e9f43ea026c681349206ee7057415f6c15fe7d6ac122c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee8f3e07f6e66b11725e9f43ea026c681349206ee7057415f6c15fe7d6ac122c","first_computed_at":"2026-05-17T23:47:49.232567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:49.232567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U8w4FGTcU+TdWTZQIDNskrBiN9oGG8GWg3mBmTA9ITaEso3e+zCbXbZ4xWNMwReuxWyvVFUdMbxq/unysn2CDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:49.233345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07485","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff26c96e8b8d532299b7e4a5cce9faf2385c2482e48173abcd23e1897df17650","sha256:a8e935b54014d9a2de2f11f6b2ad1aa241c6982c960d4dbc32ac3d26d2efb6ce"],"state_sha256":"1cfd64b8f217645af64690de5caf9403623eba71811f14c3884d316fd23abdde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90RFWW+OAkjve0I5m8B5T0tWqwFgq1OrDFc1GC1fat6XMkC6CfR22rSOwSQ8R4oYN7isDTvdvm1PFlnPI3wWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:25:10.036889Z","bundle_sha256":"b9699149daf03961f0241b5b1986321eb637bd685b90785995786cecc3d20058"}}