{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:M2CNIBVO6V6MJEYRDQCVCM26VM","short_pith_number":"pith:M2CNIBVO","schema_version":"1.0","canonical_sha256":"6684d406aef57cc493111c0551335eab19818e2ed3e847465d2d22908ac7e50c","source":{"kind":"arxiv","id":"2606.09066","version":1},"attestation_state":"computed","paper":{"title":"Tight Upper Bounds on Color Reversal by Local Inversions","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep","submitted_at":"2026-06-08T06:02:41Z","abstract_excerpt":"A bicoloration of a graph $G=(V,E)$ is a map $\\beta:V\\to\\{-1,1\\}$. A local inversion at a vertex $v$ complements the subgraph induced by the neighbors of $v$ and simultaneously reverses the colors of all neighbors of $v$. Sabidussi (Discrete Mathematics, 1987) showed that every bicolored graph on $n$ vertices without isolated vertices admits a color reversal using at most $6n+3$ local inversions, and that any two bicolorings of such a graph can be transformed into each other using at most $9n$ local inversions. Recently, Porte, Sandeep, and Santra (CALDAM 2026) improved these bounds to $4n-3$ "},"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":"2606.09066","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T06:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"07c037e765b6229f9cffa104503643196bf1ff26e84b23df42723ed70686fa9f","abstract_canon_sha256":"74669c21cb685a39e249b6d495171c9382028dfc6497e6c9bb53e5ff8450cf98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:56.619045Z","signature_b64":"hs4nuMjGtAP8Tn1RzagwuPb0hVRZciK+7W2ZK46aR1RfRkaDdzUlyEzwA5CATAQOC140iY1sb6bkxmFhkouyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6684d406aef57cc493111c0551335eab19818e2ed3e847465d2d22908ac7e50c","last_reissued_at":"2026-06-09T02:07:56.618147Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:56.618147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Upper Bounds on Color Reversal by Local Inversions","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep","submitted_at":"2026-06-08T06:02:41Z","abstract_excerpt":"A bicoloration of a graph $G=(V,E)$ is a map $\\beta:V\\to\\{-1,1\\}$. A local inversion at a vertex $v$ complements the subgraph induced by the neighbors of $v$ and simultaneously reverses the colors of all neighbors of $v$. Sabidussi (Discrete Mathematics, 1987) showed that every bicolored graph on $n$ vertices without isolated vertices admits a color reversal using at most $6n+3$ local inversions, and that any two bicolorings of such a graph can be transformed into each other using at most $9n$ local inversions. Recently, Porte, Sandeep, and Santra (CALDAM 2026) improved these bounds to $4n-3$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09066","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/2606.09066/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":"2606.09066","created_at":"2026-06-09T02:07:56.618301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.09066v1","created_at":"2026-06-09T02:07:56.618301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09066","created_at":"2026-06-09T02:07:56.618301+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2CNIBVO6V6M","created_at":"2026-06-09T02:07:56.618301+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2CNIBVO6V6MJEYR","created_at":"2026-06-09T02:07:56.618301+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2CNIBVO","created_at":"2026-06-09T02:07:56.618301+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/M2CNIBVO6V6MJEYRDQCVCM26VM","json":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM.json","graph_json":"https://pith.science/api/pith-number/M2CNIBVO6V6MJEYRDQCVCM26VM/graph.json","events_json":"https://pith.science/api/pith-number/M2CNIBVO6V6MJEYRDQCVCM26VM/events.json","paper":"https://pith.science/paper/M2CNIBVO"},"agent_actions":{"view_html":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM","download_json":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM.json","view_paper":"https://pith.science/paper/M2CNIBVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.09066&json=true","fetch_graph":"https://pith.science/api/pith-number/M2CNIBVO6V6MJEYRDQCVCM26VM/graph.json","fetch_events":"https://pith.science/api/pith-number/M2CNIBVO6V6MJEYRDQCVCM26VM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM/action/storage_attestation","attest_author":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM/action/author_attestation","sign_citation":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM/action/citation_signature","submit_replication":"https://pith.science/pith/M2CNIBVO6V6MJEYRDQCVCM26VM/action/replication_record"}},"created_at":"2026-06-09T02:07:56.618301+00:00","updated_at":"2026-06-09T02:07:56.618301+00:00"}