{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6AI2QWQ3BDMY57U6FY5OGBV76Q","short_pith_number":"pith:6AI2QWQ3","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"},"canonical_sha256":"f011a85a1b08d98efe9e2e3ae306bff40dfb08cdf705d1b2dc5330ee8c920b10","source":{"kind":"arxiv","id":"2607.00611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00611","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00611v1","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00611","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"6AI2QWQ3BDMY","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"pith_short_16","alias_value":"6AI2QWQ3BDMY57U6","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"pith_short_8","alias_value":"6AI2QWQ3","created_at":"2026-07-02T01:17:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6AI2QWQ3BDMY57U6FY5OGBV76Q","target":"record","payload":{"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"},"canonical_sha256":"f011a85a1b08d98efe9e2e3ae306bff40dfb08cdf705d1b2dc5330ee8c920b10","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"},"source_kind":"arxiv","source_id":"2607.00611","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-07-02T01:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyfaqpbR/YkAUQYwHnkSlydqPvWerQW5B8hsrF3FnXhaBUhAdHHySXw2syjisHy7hFBcZzhLEGrJjSz9qbhDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T22:27:47.377856Z"},"content_sha256":"b4761bd0853cccb4cc3bcfacc26780525cef64c755c40f0d15e6e8443ea5b0b0","schema_version":"1.0","event_id":"sha256:b4761bd0853cccb4cc3bcfacc26780525cef64c755c40f0d15e6e8443ea5b0b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6AI2QWQ3BDMY57U6FY5OGBV76Q","target":"graph","payload":{"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"},"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-07-02T01:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8plVysiB1jupnfVFi6+mKTrEmfxctYGfWlL2lFwGW/FmXAEGc2FE8YiJWg4F4v+TT9qGNCdHhTEs6Gc/b00Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T22:27:47.378237Z"},"content_sha256":"d44d02b5b7ed08a45a2eb5ae64afdf1ed965c698c78e81b3ab94a3a54bd35bf2","schema_version":"1.0","event_id":"sha256:d44d02b5b7ed08a45a2eb5ae64afdf1ed965c698c78e81b3ab94a3a54bd35bf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/bundle.json","state_url":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/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-07-26T22:27:47Z","links":{"resolver":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q","bundle":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/bundle.json","state":"https://pith.science/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AI2QWQ3BDMY57U6FY5OGBV76Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6AI2QWQ3BDMY57U6FY5OGBV76Q","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":"f225c6e64a7b27f6f6225cf28e70e9c66a41fbcafd8ac816c6c5f6f1164aed35","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:35:17Z","title_canon_sha256":"f5066ac1777f4186b5e8c2099b6fe485be8203ba4089161abe8364bdf8a1d632"},"schema_version":"1.0","source":{"id":"2607.00611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00611","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00611v1","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00611","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"6AI2QWQ3BDMY","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"pith_short_16","alias_value":"6AI2QWQ3BDMY57U6","created_at":"2026-07-02T01:17:49Z"},{"alias_kind":"pith_short_8","alias_value":"6AI2QWQ3","created_at":"2026-07-02T01:17:49Z"}],"graph_snapshots":[{"event_id":"sha256:d44d02b5b7ed08a45a2eb5ae64afdf1ed965c698c78e81b3ab94a3a54bd35bf2","target":"graph","created_at":"2026-07-02T01:17: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00611/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christof Brandstetter, Elisabeth Gaar, Markus Sinnl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:35:17Z","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00611","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:b4761bd0853cccb4cc3bcfacc26780525cef64c755c40f0d15e6e8443ea5b0b0","target":"record","created_at":"2026-07-02T01:17: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":"f225c6e64a7b27f6f6225cf28e70e9c66a41fbcafd8ac816c6c5f6f1164aed35","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:35:17Z","title_canon_sha256":"f5066ac1777f4186b5e8c2099b6fe485be8203ba4089161abe8364bdf8a1d632"},"schema_version":"1.0","source":{"id":"2607.00611","kind":"arxiv","version":1}},"canonical_sha256":"f011a85a1b08d98efe9e2e3ae306bff40dfb08cdf705d1b2dc5330ee8c920b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f011a85a1b08d98efe9e2e3ae306bff40dfb08cdf705d1b2dc5330ee8c920b10","first_computed_at":"2026-07-02T01:17:49.131551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:49.131551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w5ukFWL2TrNDXaRSMYsR3B5Q2ZBGArksoI+LH9MAePQgKDywH79il9azxEuwEz0IbLBZUJfEFjxtPDi5AHj1Dg==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:49.134716Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4761bd0853cccb4cc3bcfacc26780525cef64c755c40f0d15e6e8443ea5b0b0","sha256:d44d02b5b7ed08a45a2eb5ae64afdf1ed965c698c78e81b3ab94a3a54bd35bf2"],"state_sha256":"48f7186e9f2a532e6f964d043d6e366f0553f7bc33c26d20b6c27e8fcba88ce6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9IROvqkyRO30ZwA3hjh7qrSOt8Tw62rk84btgWYLnSzj7rAVH1fUuAFzyW3EZWwR/xTSMP+uKfBnlebWC3vAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T22:27:47.380390Z","bundle_sha256":"8afafb50dc43f33cd6bb81b1d26b6b1a46497309159c7e07610b954894968550"}}