{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FNQNK7K7BJTSJMDYEJSXSVRXKU","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":"4984f2ef52e9c324490a89b1221db2c3ba9b0bf63a3c66a41b1d1fc152f6b789","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-31T19:46:38Z","title_canon_sha256":"fd801487e37cf8448afc95aaaff7094ead1dbc486bdb7c66e54c996bfb8b2df2"},"schema_version":"1.0","source":{"id":"2506.00689","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00689","created_at":"2026-07-05T11:15:01Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00689v2","created_at":"2026-07-05T11:15:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00689","created_at":"2026-07-05T11:15:01Z"},{"alias_kind":"pith_short_12","alias_value":"FNQNK7K7BJTS","created_at":"2026-07-05T11:15:01Z"},{"alias_kind":"pith_short_16","alias_value":"FNQNK7K7BJTSJMDY","created_at":"2026-07-05T11:15:01Z"},{"alias_kind":"pith_short_8","alias_value":"FNQNK7K7","created_at":"2026-07-05T11:15:01Z"}],"graph_snapshots":[{"event_id":"sha256:e3c34fffce6dd2324df5b8e09959e588a6167e28195bb6159f93398d0e596d84","target":"graph","created_at":"2026-07-05T11:15:01Z","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/2506.00689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G=(V(G),E(G))$ be a simple graph, and let $U\\subseteq V(G)$. Two distinct vertices $x,y\\in U$ are $U$-mutually visible if $G$ contains a shortest $x$-$y$ path that is internally disjoint from $U$. $U$ is called a mutual-visibility set of $G$ if any two vertices of $U$ are $U$-mutually visible. The mutual-visibility number $\\mu(G)$ of $G$ is the size of a largest mutual-visibility set of $G$. Let $P$ be a set of $n\\geq 3$ points in ${\\mathbb R}^2$ in general position. The disjointness graph of segments $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with","authors_text":"Christophe Ndjatchi, J. Lea\\~nos, L. M. R\\'ios-Castro, M. Lomel\\'i-Haro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-31T19:46:38Z","title":"Mutual-visibility of the disjointness graph of segments in ${\\mathbb R}^2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00689","kind":"arxiv","version":2},"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:978ea034533f03775f2ee09e6de53b831e2326f608603d4ffdf69730bbd6fe6b","target":"record","created_at":"2026-07-05T11:15:01Z","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":"4984f2ef52e9c324490a89b1221db2c3ba9b0bf63a3c66a41b1d1fc152f6b789","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-31T19:46:38Z","title_canon_sha256":"fd801487e37cf8448afc95aaaff7094ead1dbc486bdb7c66e54c996bfb8b2df2"},"schema_version":"1.0","source":{"id":"2506.00689","kind":"arxiv","version":2}},"canonical_sha256":"2b60d57d5f0a6724b0782265795637551c188a7e14e777d500a5ceb89b51c47d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b60d57d5f0a6724b0782265795637551c188a7e14e777d500a5ceb89b51c47d","first_computed_at":"2026-07-05T11:15:01.235225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:01.235225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYuLDx+REixCXAghGAPpyy3ransxzh084PN/JWk9JqfAP8CSbqaNMhQzLasxIiUCzR0N4zOe9bfLd7w2mKQ8Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:01.235703Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00689","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:978ea034533f03775f2ee09e6de53b831e2326f608603d4ffdf69730bbd6fe6b","sha256:e3c34fffce6dd2324df5b8e09959e588a6167e28195bb6159f93398d0e596d84"],"state_sha256":"2e8c8475eed06f6819cf9de6f0b0511b973a2e4d0527d4dca7186ec29734d238"}