{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HVUKVE4RH27XHDKIT2IGW2FGTI","short_pith_number":"pith:HVUKVE4R","schema_version":"1.0","canonical_sha256":"3d68aa93913ebf738d489e906b68a69a1baaf1d30ce30a8a245b0685a7b94305","source":{"kind":"arxiv","id":"2406.10780","version":2},"attestation_state":"computed","paper":{"title":"Colouring negative exact-distance graphs of signed graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel A. Quiroz, Patrice Ossona de Mendez, Reza Naserasr, Robert \\v{S}\\'amal, Weiqiang Yu","submitted_at":"2024-06-16T02:22:08Z","abstract_excerpt":"The $k$-th exact-distance graph, of a graph $G$ has $V(G)$ as its vertex set, and $xy$ as an edge if and only if the distance between $x$ and $y$ is (exactly) $k$ in $G$. We consider two possible extensions of this notion for signed graphs. Finding the chromatic number of a negative exact-distance square of a signed graph is a weakening of the problem of finding the smallest target graph to which the signed graph has a sign-preserving homomorphism. We study the chromatic number of negative exact-distance graphs of signed graphs that are planar, and also the relation of these chromatic numbers "},"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":"2406.10780","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-16T02:22:08Z","cross_cats_sorted":[],"title_canon_sha256":"09728fbd3bde45a20028558a4cd91070805666e0cdc39d89b9bb587191f3441a","abstract_canon_sha256":"3d085403b6aa54d688145d6b8dade11c11f603bee9853d6772167ed19fedf581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:00.650997Z","signature_b64":"51c/W8RdejfTnk9PvXBLbzTW5HZ6ihAno7TUGRgJli55188Ix0HAcHd68DarX34rWJVoM3OAoRju8EHl3EfjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d68aa93913ebf738d489e906b68a69a1baaf1d30ce30a8a245b0685a7b94305","last_reissued_at":"2026-07-02T01:18:00.650575Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:00.650575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring negative exact-distance graphs of signed graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel A. Quiroz, Patrice Ossona de Mendez, Reza Naserasr, Robert \\v{S}\\'amal, Weiqiang Yu","submitted_at":"2024-06-16T02:22:08Z","abstract_excerpt":"The $k$-th exact-distance graph, of a graph $G$ has $V(G)$ as its vertex set, and $xy$ as an edge if and only if the distance between $x$ and $y$ is (exactly) $k$ in $G$. We consider two possible extensions of this notion for signed graphs. Finding the chromatic number of a negative exact-distance square of a signed graph is a weakening of the problem of finding the smallest target graph to which the signed graph has a sign-preserving homomorphism. We study the chromatic number of negative exact-distance graphs of signed graphs that are planar, and also the relation of these chromatic numbers "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10780","kind":"arxiv","version":2},"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/2406.10780/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":"2406.10780","created_at":"2026-07-02T01:18:00.650641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.10780v2","created_at":"2026-07-02T01:18:00.650641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10780","created_at":"2026-07-02T01:18:00.650641+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVUKVE4RH27X","created_at":"2026-07-02T01:18:00.650641+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVUKVE4RH27XHDKI","created_at":"2026-07-02T01:18:00.650641+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVUKVE4R","created_at":"2026-07-02T01:18:00.650641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI","json":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI.json","graph_json":"https://pith.science/api/pith-number/HVUKVE4RH27XHDKIT2IGW2FGTI/graph.json","events_json":"https://pith.science/api/pith-number/HVUKVE4RH27XHDKIT2IGW2FGTI/events.json","paper":"https://pith.science/paper/HVUKVE4R"},"agent_actions":{"view_html":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI","download_json":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI.json","view_paper":"https://pith.science/paper/HVUKVE4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.10780&json=true","fetch_graph":"https://pith.science/api/pith-number/HVUKVE4RH27XHDKIT2IGW2FGTI/graph.json","fetch_events":"https://pith.science/api/pith-number/HVUKVE4RH27XHDKIT2IGW2FGTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI/action/storage_attestation","attest_author":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI/action/author_attestation","sign_citation":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI/action/citation_signature","submit_replication":"https://pith.science/pith/HVUKVE4RH27XHDKIT2IGW2FGTI/action/replication_record"}},"created_at":"2026-07-02T01:18:00.650641+00:00","updated_at":"2026-07-02T01:18:00.650641+00:00"}