{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:MRRWJL44NP3TS4UWJZFZKISSKM","short_pith_number":"pith:MRRWJL44","canonical_record":{"source":{"id":"0709.0910","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-09-06T16:26:25Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1f42a206dfdb9bfb984f27adab62fa9b98ba742bf160a86adfc4c7d875126e40","abstract_canon_sha256":"19a939c978fef5dca4feb6f3cc1b8494f699a4c06610827bbe855083b3f3352a"},"schema_version":"1.0"},"canonical_sha256":"646364af9c6bf73972964e4b952252532e92c53145a957b75aca1cfbe3f68ead","source":{"kind":"arxiv","id":"0709.0910","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.0910","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"0709.0910v4","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.0910","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"MRRWJL44NP3T","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"MRRWJL44NP3TS4UW","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"MRRWJL44","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:MRRWJL44NP3TS4UWJZFZKISSKM","target":"record","payload":{"canonical_record":{"source":{"id":"0709.0910","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-09-06T16:26:25Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1f42a206dfdb9bfb984f27adab62fa9b98ba742bf160a86adfc4c7d875126e40","abstract_canon_sha256":"19a939c978fef5dca4feb6f3cc1b8494f699a4c06610827bbe855083b3f3352a"},"schema_version":"1.0"},"canonical_sha256":"646364af9c6bf73972964e4b952252532e92c53145a957b75aca1cfbe3f68ead","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.545807Z","signature_b64":"ShuSIp78zvQvQepu216dPjWC4cuCnCeSC6mFvcxgoCRMxh2U50OpQO+PgtnMa4wFbF4XfpvXVjambhKYrarBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"646364af9c6bf73972964e4b952252532e92c53145a957b75aca1cfbe3f68ead","last_reissued_at":"2026-05-18T04:16:32.545331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.545331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0709.0910","source_version":4,"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-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vxFNwHrCCDNYW++rFxzyYWhkchGIJ8yJbJmDMb94PbD8O3qDM78c79L3R6oUTsDCVxFDmFvV8Dc1FuOYhhSZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:09:28.383899Z"},"content_sha256":"e1d268451f6abb92d78f73dba1c63c79874de3b38a597abc319ba0008ab5d2fe","schema_version":"1.0","event_id":"sha256:e1d268451f6abb92d78f73dba1c63c79874de3b38a597abc319ba0008ab5d2fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:MRRWJL44NP3TS4UWJZFZKISSKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a class of metrics related to graph layout problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Adam N. Letchford, Dirk Oliver Theis, Hanna Seitz","submitted_at":"2007-09-06T16:26:25Z","abstract_excerpt":"We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the literature, and also to a class of combinatorial optimization problems known as graph layout problems. We prove several results about the structure of these metrics. In particular, it is shown that their convex hull is not closed in general. We then show that certain linear inequalities define facets of the closure of the convex hull. Finally, we characterise th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.0910","kind":"arxiv","version":4},"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-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ITi2vQ/yue5cdRpcVHsBB/+KlEZ3OYH607LKfaDM3VA/tzSsmxyNJfStTi30VxHyHwwEUTG5a0CvgWP6RIdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:09:28.384252Z"},"content_sha256":"2a395027f9d5791afbebf992937b010fe5acd9da6e3148e586da919ad11a8e54","schema_version":"1.0","event_id":"sha256:2a395027f9d5791afbebf992937b010fe5acd9da6e3148e586da919ad11a8e54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRRWJL44NP3TS4UWJZFZKISSKM/bundle.json","state_url":"https://pith.science/pith/MRRWJL44NP3TS4UWJZFZKISSKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRRWJL44NP3TS4UWJZFZKISSKM/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-02T13:09:28Z","links":{"resolver":"https://pith.science/pith/MRRWJL44NP3TS4UWJZFZKISSKM","bundle":"https://pith.science/pith/MRRWJL44NP3TS4UWJZFZKISSKM/bundle.json","state":"https://pith.science/pith/MRRWJL44NP3TS4UWJZFZKISSKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRRWJL44NP3TS4UWJZFZKISSKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:MRRWJL44NP3TS4UWJZFZKISSKM","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":"19a939c978fef5dca4feb6f3cc1b8494f699a4c06610827bbe855083b3f3352a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-09-06T16:26:25Z","title_canon_sha256":"1f42a206dfdb9bfb984f27adab62fa9b98ba742bf160a86adfc4c7d875126e40"},"schema_version":"1.0","source":{"id":"0709.0910","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.0910","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"0709.0910v4","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.0910","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"MRRWJL44NP3T","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"MRRWJL44NP3TS4UW","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"MRRWJL44","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:2a395027f9d5791afbebf992937b010fe5acd9da6e3148e586da919ad11a8e54","target":"graph","created_at":"2026-05-18T04:16:32Z","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":"We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the literature, and also to a class of combinatorial optimization problems known as graph layout problems. We prove several results about the structure of these metrics. In particular, it is shown that their convex hull is not closed in general. We then show that certain linear inequalities define facets of the closure of the convex hull. Finally, we characterise th","authors_text":"Adam N. Letchford, Dirk Oliver Theis, Hanna Seitz","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-09-06T16:26:25Z","title":"On a class of metrics related to graph layout problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.0910","kind":"arxiv","version":4},"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:e1d268451f6abb92d78f73dba1c63c79874de3b38a597abc319ba0008ab5d2fe","target":"record","created_at":"2026-05-18T04:16:32Z","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":"19a939c978fef5dca4feb6f3cc1b8494f699a4c06610827bbe855083b3f3352a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-09-06T16:26:25Z","title_canon_sha256":"1f42a206dfdb9bfb984f27adab62fa9b98ba742bf160a86adfc4c7d875126e40"},"schema_version":"1.0","source":{"id":"0709.0910","kind":"arxiv","version":4}},"canonical_sha256":"646364af9c6bf73972964e4b952252532e92c53145a957b75aca1cfbe3f68ead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"646364af9c6bf73972964e4b952252532e92c53145a957b75aca1cfbe3f68ead","first_computed_at":"2026-05-18T04:16:32.545331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:32.545331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ShuSIp78zvQvQepu216dPjWC4cuCnCeSC6mFvcxgoCRMxh2U50OpQO+PgtnMa4wFbF4XfpvXVjambhKYrarBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:32.545807Z","signed_message":"canonical_sha256_bytes"},"source_id":"0709.0910","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1d268451f6abb92d78f73dba1c63c79874de3b38a597abc319ba0008ab5d2fe","sha256:2a395027f9d5791afbebf992937b010fe5acd9da6e3148e586da919ad11a8e54"],"state_sha256":"f08ec68a815d1b19873778ffa81361b60f349e370f4982a384badbe78a052c5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSNk27QhaUcdE2O18uiYuQVqhV1d4/KUAMmsG63Mbl0RkdkVUWQCEKCqt6+MxLqL3yZN1iU0vtQkfLW0LvcoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:09:28.386293Z","bundle_sha256":"53ba1e686766ae4a029500712dae97032e6fe60560ec3f40b26a2b7a70346ddb"}}