{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7CJUST5LYIT2UVOKQS6XHMIT5V","short_pith_number":"pith:7CJUST5L","schema_version":"1.0","canonical_sha256":"f893494fabc227aa55ca84bd73b113ed798f5bd78c6c57f2b234685e42c71f0f","source":{"kind":"arxiv","id":"2311.18284","version":1},"attestation_state":"computed","paper":{"title":"The Complement of the Djokovic-Winkler Relation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bruno J. Schmidt, Guillaume E. Scholz, Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu","submitted_at":"2023-11-30T06:44:11Z","abstract_excerpt":"The Djokovi\\'{c}-Winkler relation $\\Theta$ is a binary relation defined on the edge set of a given graph that is based on the distances of certain vertices and which plays a prominent role in graph theory. In this paper, we explore the relatively uncharted ``reflexive complement'' $\\overline\\Theta$ of $\\Theta$, where $(e,f)\\in \\overline\\Theta$ if and only if $e=f$ or $(e,f)\\notin \\Theta$ for edges $e$ and $f$. We establish the relationship between $\\overline\\Theta$ and the set $\\Delta_{ef}$, comprising the distances between the vertices of $e$ and $f$ and shed some light on the intricacies of "},"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":"2311.18284","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-30T06:44:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6d2dc9c863e56922bd7b11583eaceb0ee92c5dfee5d9c6838fa0eaf9b4fdb254","abstract_canon_sha256":"7c0aa9ad5a43f2beec801d6b478f350df5e3fd6098c2cf9496a4d5ae7da3e3a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:40.090619Z","signature_b64":"t2tlQW+tnE3Ne2VzfyzyVwz667Wt3VRobUT9QvrA3buhCam76QhYnZukjM3j7HWJHdWqE+x2aq8i7vavLAhiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f893494fabc227aa55ca84bd73b113ed798f5bd78c6c57f2b234685e42c71f0f","last_reissued_at":"2026-07-05T07:18:40.090141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:40.090141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complement of the Djokovic-Winkler Relation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bruno J. Schmidt, Guillaume E. Scholz, Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu","submitted_at":"2023-11-30T06:44:11Z","abstract_excerpt":"The Djokovi\\'{c}-Winkler relation $\\Theta$ is a binary relation defined on the edge set of a given graph that is based on the distances of certain vertices and which plays a prominent role in graph theory. In this paper, we explore the relatively uncharted ``reflexive complement'' $\\overline\\Theta$ of $\\Theta$, where $(e,f)\\in \\overline\\Theta$ if and only if $e=f$ or $(e,f)\\notin \\Theta$ for edges $e$ and $f$. We establish the relationship between $\\overline\\Theta$ and the set $\\Delta_{ef}$, comprising the distances between the vertices of $e$ and $f$ and shed some light on the intricacies of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18284","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/2311.18284/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":"2311.18284","created_at":"2026-07-05T07:18:40.090198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.18284v1","created_at":"2026-07-05T07:18:40.090198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18284","created_at":"2026-07-05T07:18:40.090198+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CJUST5LYIT2","created_at":"2026-07-05T07:18:40.090198+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CJUST5LYIT2UVOK","created_at":"2026-07-05T07:18:40.090198+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CJUST5L","created_at":"2026-07-05T07:18:40.090198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29391","citing_title":"Minimal Isometric Embeddings of Graphs into Abelian Groups: Theory, Algorithms, and Applications to Signal Processing over Networks","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V","json":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V.json","graph_json":"https://pith.science/api/pith-number/7CJUST5LYIT2UVOKQS6XHMIT5V/graph.json","events_json":"https://pith.science/api/pith-number/7CJUST5LYIT2UVOKQS6XHMIT5V/events.json","paper":"https://pith.science/paper/7CJUST5L"},"agent_actions":{"view_html":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V","download_json":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V.json","view_paper":"https://pith.science/paper/7CJUST5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.18284&json=true","fetch_graph":"https://pith.science/api/pith-number/7CJUST5LYIT2UVOKQS6XHMIT5V/graph.json","fetch_events":"https://pith.science/api/pith-number/7CJUST5LYIT2UVOKQS6XHMIT5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V/action/storage_attestation","attest_author":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V/action/author_attestation","sign_citation":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V/action/citation_signature","submit_replication":"https://pith.science/pith/7CJUST5LYIT2UVOKQS6XHMIT5V/action/replication_record"}},"created_at":"2026-07-05T07:18:40.090198+00:00","updated_at":"2026-07-05T07:18:40.090198+00:00"}