{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DZBUSUMLICMQEBJ7PP56EQEX7W","short_pith_number":"pith:DZBUSUML","schema_version":"1.0","canonical_sha256":"1e4349518b409902053f7bfbe24097fd9507c9d4c0686be12cfd5d5c7841473b","source":{"kind":"arxiv","id":"2307.04652","version":2},"attestation_state":"computed","paper":{"title":"Winding number and circular 4-coloring of signed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Gujgiczer, Reza Naserasr, Rohini S, S Taruni","submitted_at":"2023-07-10T15:49:47Z","abstract_excerpt":"Concerning the recent notion of circular chromatic number of signed graphs, for each given integer $k$ we introduce two signed bipartite graphs, each on $2k^2-k+1$ vertices, having shortest negative cycle of length $2k$, and the circular chromatic number 4.\n  Each of the construction can be viewed as a bipartite analogue of the generalized Mycielski graphs on odd cycles, $M_{\\ell}(C_{2k+1})$. In the course of proving our result, we also obtain a simple proof of the fact that $M_{\\ell}(C_{2k+1})$ and some similar quadrangulations of the projective plane have circular chromatic number 4. These p"},"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":"2307.04652","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-10T15:49:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"86bfd8d66d681ebc9445128ec5b499ba71c50fff231d256c2625746619caf4d8","abstract_canon_sha256":"62176432bde3784f912c4c01f91285a9416c5e6160b63fc3607cee58a7a0db6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:51.201923Z","signature_b64":"i9Svj5nh5eIJAmxIwd5WBQOeKWYjxUae7eI2j2qzFaigCortfvINFbxnVIeB4WWCRAxXPamaS7E+n+zz21J5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e4349518b409902053f7bfbe24097fd9507c9d4c0686be12cfd5d5c7841473b","last_reissued_at":"2026-07-05T07:50:51.201444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:51.201444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Winding number and circular 4-coloring of signed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Gujgiczer, Reza Naserasr, Rohini S, S Taruni","submitted_at":"2023-07-10T15:49:47Z","abstract_excerpt":"Concerning the recent notion of circular chromatic number of signed graphs, for each given integer $k$ we introduce two signed bipartite graphs, each on $2k^2-k+1$ vertices, having shortest negative cycle of length $2k$, and the circular chromatic number 4.\n  Each of the construction can be viewed as a bipartite analogue of the generalized Mycielski graphs on odd cycles, $M_{\\ell}(C_{2k+1})$. In the course of proving our result, we also obtain a simple proof of the fact that $M_{\\ell}(C_{2k+1})$ and some similar quadrangulations of the projective plane have circular chromatic number 4. These p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04652","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/2307.04652/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":"2307.04652","created_at":"2026-07-05T07:50:51.201500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04652v2","created_at":"2026-07-05T07:50:51.201500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04652","created_at":"2026-07-05T07:50:51.201500+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZBUSUMLICMQ","created_at":"2026-07-05T07:50:51.201500+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZBUSUMLICMQEBJ7","created_at":"2026-07-05T07:50:51.201500+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZBUSUML","created_at":"2026-07-05T07:50:51.201500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18858","citing_title":"Why you shouldn't fully trust ChatGPT: A synthesis of this AI tool's error rates across disciplines and the software engineering lifecycle","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W","json":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W.json","graph_json":"https://pith.science/api/pith-number/DZBUSUMLICMQEBJ7PP56EQEX7W/graph.json","events_json":"https://pith.science/api/pith-number/DZBUSUMLICMQEBJ7PP56EQEX7W/events.json","paper":"https://pith.science/paper/DZBUSUML"},"agent_actions":{"view_html":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W","download_json":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W.json","view_paper":"https://pith.science/paper/DZBUSUML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04652&json=true","fetch_graph":"https://pith.science/api/pith-number/DZBUSUMLICMQEBJ7PP56EQEX7W/graph.json","fetch_events":"https://pith.science/api/pith-number/DZBUSUMLICMQEBJ7PP56EQEX7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W/action/storage_attestation","attest_author":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W/action/author_attestation","sign_citation":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W/action/citation_signature","submit_replication":"https://pith.science/pith/DZBUSUMLICMQEBJ7PP56EQEX7W/action/replication_record"}},"created_at":"2026-07-05T07:50:51.201500+00:00","updated_at":"2026-07-05T07:50:51.201500+00:00"}