{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MLEEODLMWWS34T3O4KACNE5LQG","short_pith_number":"pith:MLEEODLM","canonical_record":{"source":{"id":"1508.03810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-16T11:12:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d3ee3dd133bafe12ae2c6cf546687229dee32ad811a20bf373522594089fcbae","abstract_canon_sha256":"d5b8f26924d65fcf0050c01e345b02d346e212a9dd8756287ae0bb3f1a03754d"},"schema_version":"1.0"},"canonical_sha256":"62c8470d6cb5a5be4f6ee2802693ab8197e66235aeddccf5ee3d4642e075ab3b","source":{"kind":"arxiv","id":"1508.03810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03810","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03810v1","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03810","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"MLEEODLMWWS3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLEEODLMWWS34T3O","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLEEODLM","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MLEEODLMWWS34T3O4KACNE5LQG","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-16T11:12:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d3ee3dd133bafe12ae2c6cf546687229dee32ad811a20bf373522594089fcbae","abstract_canon_sha256":"d5b8f26924d65fcf0050c01e345b02d346e212a9dd8756287ae0bb3f1a03754d"},"schema_version":"1.0"},"canonical_sha256":"62c8470d6cb5a5be4f6ee2802693ab8197e66235aeddccf5ee3d4642e075ab3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.066384Z","signature_b64":"3juQ4Pgb/ecktuN2/lP/M4XUD+xMgZlQrfmcFq9tQwwMx1/xSYugtEala00Wzdfh93XfrFrnvbxcsUj017r5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c8470d6cb5a5be4f6ee2802693ab8197e66235aeddccf5ee3d4642e075ab3b","last_reissued_at":"2026-05-18T01:09:46.065702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.065702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03810","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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRBzLgje5DTzrLk31sFt7NOwdlG2gS8kJH2NKw+CMt5uOBbgNaNLInRQTO+F+AGYciMeBErZcCaomSWca1GvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:48:45.870283Z"},"content_sha256":"b2e4011956122ff04fe47707f29cb6d4cc5c3edcf11007a7c2209b19c14237a9","schema_version":"1.0","event_id":"sha256:b2e4011956122ff04fe47707f29cb6d4cc5c3edcf11007a7c2209b19c14237a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MLEEODLMWWS34T3O4KACNE5LQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max Point-Tolerance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bjarni V. Halld\\'orsson, Daniele Catanzaro, Juraj Stacho, Magn\\'us M. Halld\\'orsson, Stefan Felsner, Steven Chaplick, Thomas Hixon","submitted_at":"2015-08-16T11:12:23Z","abstract_excerpt":"A graph $G$ is a \\emph{max point-tolerance (MPT)} graph if each vertex $v$ of $G$ can be mapped to a \\emph{pointed-interval} $(I_v, p_v)$ where $I_v$ is an interval of $\\mathbb{R}$ and $p_v \\in I_v$ such that $uv$ is an edge of $G$ iff $I_u \\cap I_v \\supseteq \\{p_u, p_v\\}$. MPT graphs model relationships among DNA fragments in genome-wide association studies as well as basic transmission problems in telecommunications. We formally introduce this graph class, characterize it, study combinatorial optimization problems on it, and relate it to several well known graph classes. We characterize MPT "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03810","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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuDYKZeqvBz24iBNVAk6Cvi8OWFKiz6mOGvBhJ0kmt+jTqgDTzmklSGzsUlHFCa0+JULEth5EgHaMXzIFvmLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:48:45.870652Z"},"content_sha256":"13d0159ffb5ca52a17cc6fc370408b5e859a9058478abaaacae3c9f33d9bb621","schema_version":"1.0","event_id":"sha256:13d0159ffb5ca52a17cc6fc370408b5e859a9058478abaaacae3c9f33d9bb621"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLEEODLMWWS34T3O4KACNE5LQG/bundle.json","state_url":"https://pith.science/pith/MLEEODLMWWS34T3O4KACNE5LQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLEEODLMWWS34T3O4KACNE5LQG/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-02T06:48:45Z","links":{"resolver":"https://pith.science/pith/MLEEODLMWWS34T3O4KACNE5LQG","bundle":"https://pith.science/pith/MLEEODLMWWS34T3O4KACNE5LQG/bundle.json","state":"https://pith.science/pith/MLEEODLMWWS34T3O4KACNE5LQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLEEODLMWWS34T3O4KACNE5LQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MLEEODLMWWS34T3O4KACNE5LQG","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":"d5b8f26924d65fcf0050c01e345b02d346e212a9dd8756287ae0bb3f1a03754d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-16T11:12:23Z","title_canon_sha256":"d3ee3dd133bafe12ae2c6cf546687229dee32ad811a20bf373522594089fcbae"},"schema_version":"1.0","source":{"id":"1508.03810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03810","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03810v1","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03810","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"MLEEODLMWWS3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLEEODLMWWS34T3O","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLEEODLM","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:13d0159ffb5ca52a17cc6fc370408b5e859a9058478abaaacae3c9f33d9bb621","target":"graph","created_at":"2026-05-18T01:09:46Z","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":"A graph $G$ is a \\emph{max point-tolerance (MPT)} graph if each vertex $v$ of $G$ can be mapped to a \\emph{pointed-interval} $(I_v, p_v)$ where $I_v$ is an interval of $\\mathbb{R}$ and $p_v \\in I_v$ such that $uv$ is an edge of $G$ iff $I_u \\cap I_v \\supseteq \\{p_u, p_v\\}$. MPT graphs model relationships among DNA fragments in genome-wide association studies as well as basic transmission problems in telecommunications. We formally introduce this graph class, characterize it, study combinatorial optimization problems on it, and relate it to several well known graph classes. We characterize MPT ","authors_text":"Bjarni V. Halld\\'orsson, Daniele Catanzaro, Juraj Stacho, Magn\\'us M. Halld\\'orsson, Stefan Felsner, Steven Chaplick, Thomas Hixon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-16T11:12:23Z","title":"Max Point-Tolerance Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03810","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:b2e4011956122ff04fe47707f29cb6d4cc5c3edcf11007a7c2209b19c14237a9","target":"record","created_at":"2026-05-18T01:09:46Z","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":"d5b8f26924d65fcf0050c01e345b02d346e212a9dd8756287ae0bb3f1a03754d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-16T11:12:23Z","title_canon_sha256":"d3ee3dd133bafe12ae2c6cf546687229dee32ad811a20bf373522594089fcbae"},"schema_version":"1.0","source":{"id":"1508.03810","kind":"arxiv","version":1}},"canonical_sha256":"62c8470d6cb5a5be4f6ee2802693ab8197e66235aeddccf5ee3d4642e075ab3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c8470d6cb5a5be4f6ee2802693ab8197e66235aeddccf5ee3d4642e075ab3b","first_computed_at":"2026-05-18T01:09:46.065702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:46.065702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3juQ4Pgb/ecktuN2/lP/M4XUD+xMgZlQrfmcFq9tQwwMx1/xSYugtEala00Wzdfh93XfrFrnvbxcsUj017r5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:46.066384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2e4011956122ff04fe47707f29cb6d4cc5c3edcf11007a7c2209b19c14237a9","sha256:13d0159ffb5ca52a17cc6fc370408b5e859a9058478abaaacae3c9f33d9bb621"],"state_sha256":"6551c203efb51cc59379d6cfe7bd9e5c7df33f8cfda47e49c37f4a35d0c8b065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74WWIYi/XUdQyQAXwt8oVB3CPrv/16KpYat2hcWhqJFCOncGfiyGk8JyJMNxA2NrqGbXQxZrBBp2P5iqlgfJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:48:45.872970Z","bundle_sha256":"9a62e7684645cfb4b9dfe6314335a487b38ec5207d2b74941696653aec627eb1"}}