{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6AI2QWQ3BDMY57U6FY5OGBV76Q","short_pith_number":"pith:6AI2QWQ3","schema_version":"1.0","canonical_sha256":"f011a85a1b08d98efe9e2e3ae306bff40dfb08cdf705d1b2dc5330ee8c920b10","source":{"kind":"arxiv","id":"2607.00611","version":1},"attestation_state":"computed","paper":{"title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christof Brandstetter, Elisabeth Gaar, Markus Sinnl","submitted_at":"2026-07-01T08:35:17Z","abstract_excerpt":"In this work, we introduce a multi-objective version of the well-known single-row facility layout problem (SRFLP). In the SRFLP, a set of one-dimensional facilities should be placed along a single line such that the weighted sum of the center-to-center distances of each pair of facilities is minimized. In our multi-objective extension, there are multiple such weighted-sum objectives which we consider under the concept of Pareto optimality.\n  We develop a solution algorithm based on the $\\varepsilon$-constraint method to solve the bi-objective SRFLP. Many existing works on the $\\varepsilon$-con"},"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":"2607.00611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"f5066ac1777f4186b5e8c2099b6fe485be8203ba4089161abe8364bdf8a1d632","abstract_canon_sha256":"f225c6e64a7b27f6f6225cf28e70e9c66a41fbcafd8ac816c6c5f6f1164aed35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:49.134716Z","signature_b64":"w5ukFWL2TrNDXaRSMYsR3B5Q2ZBGArksoI+LH9MAePQgKDywH79il9azxEuwEz0IbLBZUJfEFjxtPDi5AHj1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f011a85a1b08d98efe9e2e3ae306bff40dfb08cdf705d1b2dc5330ee8c920b10","last_reissued_at":"2026-07-02T01:17:49.131551Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:49.131551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christof Brandstetter, Elisabeth Gaar, Markus Sinnl","submitted_at":"2026-07-01T08:35:17Z","abstract_excerpt":"In this work, we introduce a multi-objective version of the well-known single-row facility layout problem (SRFLP). In the SRFLP, a set of one-dimensional facilities should be placed along a single line such that the weighted sum of the center-to-center distances of each pair of facilities is minimized. In our multi-objective extension, there are multiple such weighted-sum objectives which we consider under the concept of Pareto optimality.\n  We develop a solution algorithm based on the $\\varepsilon$-constraint method to solve the bi-objective SRFLP. Many existing works on the $\\varepsilon$-con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00611","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00611/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.00611","created_at":"2026-07-02T01:17:49.131617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00611v1","created_at":"2026-07-02T01:17:49.131617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00611","created_at":"2026-07-02T01:17:49.131617+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AI2QWQ3BDMY","created_at":"2026-07-02T01:17:49.131617+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AI2QWQ3BDMY57U6","created_at":"2026-07-02T01:17:49.131617+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AI2QWQ3","created_at":"2026-07-02T01:17:49.131617+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/6AI2QWQ3BDMY57U6FY5OGBV76Q","json":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q.json","graph_json":"https://pith.science/api/pith-number/6AI2QWQ3BDMY57U6FY5OGBV76Q/graph.json","events_json":"https://pith.science/api/pith-number/6AI2QWQ3BDMY57U6FY5OGBV76Q/events.json","paper":"https://pith.science/paper/6AI2QWQ3"},"agent_actions":{"view_html":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q","download_json":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q.json","view_paper":"https://pith.science/paper/6AI2QWQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00611&json=true","fetch_graph":"https://pith.science/api/pith-number/6AI2QWQ3BDMY57U6FY5OGBV76Q/graph.json","fetch_events":"https://pith.science/api/pith-number/6AI2QWQ3BDMY57U6FY5OGBV76Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/action/storage_attestation","attest_author":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/action/author_attestation","sign_citation":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/action/citation_signature","submit_replication":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/action/replication_record"}},"created_at":"2026-07-02T01:17:49.131617+00:00","updated_at":"2026-07-02T01:17:49.131617+00:00"}