{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZG3QXJL4R2DWEVDMEQNPMZ7EIM","short_pith_number":"pith:ZG3QXJL4","canonical_record":{"source":{"id":"1806.04107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-11T16:56:56Z","cross_cats_sorted":[],"title_canon_sha256":"d2a2ef5dc3fecc646266d5f0b664e078cd3e0b76f52f185ea8579c87c58533d3","abstract_canon_sha256":"de22a603a6fa5055f592521de28dec11f12ca52919dd70a9d39cba8ebcb1a9d6"},"schema_version":"1.0"},"canonical_sha256":"c9b70ba57c8e8762546c241af667e4433f3c198cbe66de9378a77b7e5f46995e","source":{"kind":"arxiv","id":"1806.04107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04107","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04107v1","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04107","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZG3QXJL4R2DW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZG3QXJL4R2DWEVDM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZG3QXJL4","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZG3QXJL4R2DWEVDMEQNPMZ7EIM","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-11T16:56:56Z","cross_cats_sorted":[],"title_canon_sha256":"d2a2ef5dc3fecc646266d5f0b664e078cd3e0b76f52f185ea8579c87c58533d3","abstract_canon_sha256":"de22a603a6fa5055f592521de28dec11f12ca52919dd70a9d39cba8ebcb1a9d6"},"schema_version":"1.0"},"canonical_sha256":"c9b70ba57c8e8762546c241af667e4433f3c198cbe66de9378a77b7e5f46995e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:38.507453Z","signature_b64":"Hno86mZC1l3PlfTuV5qXWiTNKTDXZ4eqiZOPQURY3QvQjub20Br/IlLFbrKvd1exd0dRTYMfTpqZUB/lpB/pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b70ba57c8e8762546c241af667e4433f3c198cbe66de9378a77b7e5f46995e","last_reissued_at":"2026-05-18T00:13:38.506610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:38.506610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04107","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDuRcP1Ih8i0fIWTuh2wV9yhhPJJrWbRRuSe2yt06yL8IczkeRnjusW3A0mLXaGpfNKgXljfBVMY3/DQb/7FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:19.357955Z"},"content_sha256":"f1d8d22b20c63f2f64127af739c657ca981c2badf9e8587498ed5810d7fa02ff","schema_version":"1.0","event_id":"sha256:f1d8d22b20c63f2f64127af739c657ca981c2badf9e8587498ed5810d7fa02ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZG3QXJL4R2DWEVDMEQNPMZ7EIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distance Measuring Algorithm for Location Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dinghao Ma, Md. Noor-E-Alam, M. S. Morshed, Ruilin Ouyang","submitted_at":"2018-06-11T16:56:56Z","abstract_excerpt":"Approximating distance is one of the key challenge in a facility location problem. Several algorithms have been proposed, however, none of them focused on estimating distance between two concave regions. In this work, we present an algorithm to estimate the distance between two irregular regions of a facility location problem. The proposed algorithm can identify the distance between concave shape regions. We also discuss some relevant properties of the proposed algorithm. A distance-sensitive capacity location model is introduced to test the algorithm. Moreover, sSeveral special geometric case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04107","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+QSDvUxg6ingw0onLq/jVb6a5uKl7TWb4sy185OBoB3D14+ypKtrP0VCfRyudXoL34XY4beaawnTDq2+2SpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:19.358675Z"},"content_sha256":"f7acb3c7d1e13f4cb6002e006b1ff8d4e06fb46cfc41302bc844e1cdf53a5380","schema_version":"1.0","event_id":"sha256:f7acb3c7d1e13f4cb6002e006b1ff8d4e06fb46cfc41302bc844e1cdf53a5380"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM/bundle.json","state_url":"https://pith.science/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM/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-30T00:30:19Z","links":{"resolver":"https://pith.science/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM","bundle":"https://pith.science/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM/bundle.json","state":"https://pith.science/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZG3QXJL4R2DWEVDMEQNPMZ7EIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZG3QXJL4R2DWEVDMEQNPMZ7EIM","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":"de22a603a6fa5055f592521de28dec11f12ca52919dd70a9d39cba8ebcb1a9d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-11T16:56:56Z","title_canon_sha256":"d2a2ef5dc3fecc646266d5f0b664e078cd3e0b76f52f185ea8579c87c58533d3"},"schema_version":"1.0","source":{"id":"1806.04107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04107","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04107v1","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04107","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZG3QXJL4R2DW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZG3QXJL4R2DWEVDM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZG3QXJL4","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f7acb3c7d1e13f4cb6002e006b1ff8d4e06fb46cfc41302bc844e1cdf53a5380","target":"graph","created_at":"2026-05-18T00:13:38Z","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":"Approximating distance is one of the key challenge in a facility location problem. Several algorithms have been proposed, however, none of them focused on estimating distance between two concave regions. In this work, we present an algorithm to estimate the distance between two irregular regions of a facility location problem. The proposed algorithm can identify the distance between concave shape regions. We also discuss some relevant properties of the proposed algorithm. A distance-sensitive capacity location model is introduced to test the algorithm. Moreover, sSeveral special geometric case","authors_text":"Dinghao Ma, Md. Noor-E-Alam, M. S. Morshed, Ruilin Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-11T16:56:56Z","title":"A Distance Measuring Algorithm for Location Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04107","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:f1d8d22b20c63f2f64127af739c657ca981c2badf9e8587498ed5810d7fa02ff","target":"record","created_at":"2026-05-18T00:13:38Z","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":"de22a603a6fa5055f592521de28dec11f12ca52919dd70a9d39cba8ebcb1a9d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-11T16:56:56Z","title_canon_sha256":"d2a2ef5dc3fecc646266d5f0b664e078cd3e0b76f52f185ea8579c87c58533d3"},"schema_version":"1.0","source":{"id":"1806.04107","kind":"arxiv","version":1}},"canonical_sha256":"c9b70ba57c8e8762546c241af667e4433f3c198cbe66de9378a77b7e5f46995e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9b70ba57c8e8762546c241af667e4433f3c198cbe66de9378a77b7e5f46995e","first_computed_at":"2026-05-18T00:13:38.506610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:38.506610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hno86mZC1l3PlfTuV5qXWiTNKTDXZ4eqiZOPQURY3QvQjub20Br/IlLFbrKvd1exd0dRTYMfTpqZUB/lpB/pDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:38.507453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d8d22b20c63f2f64127af739c657ca981c2badf9e8587498ed5810d7fa02ff","sha256:f7acb3c7d1e13f4cb6002e006b1ff8d4e06fb46cfc41302bc844e1cdf53a5380"],"state_sha256":"171703832438f9d78ca47084576498b2a69e9522c127383753daecee6cc10cfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFJlU7yt53A62EKR6a+e4YP2vZ9Zkvj5eHVIfBdysYUv/3rbbeAbnvco4B0Byx4GtNLEFB+/uANg/MFdt65BCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:30:19.366792Z","bundle_sha256":"cf8a9b9d59232a82f38e2dc7bec1ab1484a8d4a8bcfb608ccb4f15eea820ac2c"}}