{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZN5POEXYXBBWLWBNGLFS7NBD4A","short_pith_number":"pith:ZN5POEXY","schema_version":"1.0","canonical_sha256":"cb7af712f8b84365d82d32cb2fb423e02cdbbf4b4b09ea61234537726fed45a0","source":{"kind":"arxiv","id":"1706.02335","version":1},"attestation_state":"computed","paper":{"title":"Injective chromatic number of outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Mahsa Mozafari-Nia","submitted_at":"2017-06-07T18:50:14Z","abstract_excerpt":"An injective coloring of a graph is a vertex coloring where two vertices with common neighbor receive distinct colors. The minimum integer $k$ that $G$ has a $k-$injective coloring is called injective chromatic number of $G$ and denoted by $\\chi_i(G)$. In this paper, the injective chromatic number of outerplanar graphs with maximum degree $\\Delta$ and girth $g$ is studied. It is shown that for every outerplanar graph, $\\chi_i(G)\\leq \\Delta+2$, and this bound is tight. Then, it is proved that for outerplanar graphs with $\\Delta=3$, $\\chi_i(G)\\leq \\Delta+1$ and the bound is tight for outerplanar"},"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":"1706.02335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-07T18:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"de398c818f43ead7f08e4577da99a3e7ea65923e6d3a80600156f5da68e0079b","abstract_canon_sha256":"b6fac02ec7458bd059eb5a7d89b8d7174943b7a3a94e7b3aa853e3fadc6fb3bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:45.728385Z","signature_b64":"h1OOAk97nXtWm2PfutppPdbGE8I3wSgyBrqq6WYyOcuh2WlkVVPq/iA8e1KjEOXs/SGuQsZ+VfVRw09qYCuVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb7af712f8b84365d82d32cb2fb423e02cdbbf4b4b09ea61234537726fed45a0","last_reissued_at":"2026-05-18T00:42:45.727637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:45.727637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Injective chromatic number of outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Mahsa Mozafari-Nia","submitted_at":"2017-06-07T18:50:14Z","abstract_excerpt":"An injective coloring of a graph is a vertex coloring where two vertices with common neighbor receive distinct colors. The minimum integer $k$ that $G$ has a $k-$injective coloring is called injective chromatic number of $G$ and denoted by $\\chi_i(G)$. In this paper, the injective chromatic number of outerplanar graphs with maximum degree $\\Delta$ and girth $g$ is studied. It is shown that for every outerplanar graph, $\\chi_i(G)\\leq \\Delta+2$, and this bound is tight. Then, it is proved that for outerplanar graphs with $\\Delta=3$, $\\chi_i(G)\\leq \\Delta+1$ and the bound is tight for outerplanar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02335","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":""},"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":"1706.02335","created_at":"2026-05-18T00:42:45.727749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02335v1","created_at":"2026-05-18T00:42:45.727749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02335","created_at":"2026-05-18T00:42:45.727749+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZN5POEXYXBBW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZN5POEXYXBBWLWBN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZN5POEXY","created_at":"2026-05-18T12:31:59.375834+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/ZN5POEXYXBBWLWBNGLFS7NBD4A","json":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A.json","graph_json":"https://pith.science/api/pith-number/ZN5POEXYXBBWLWBNGLFS7NBD4A/graph.json","events_json":"https://pith.science/api/pith-number/ZN5POEXYXBBWLWBNGLFS7NBD4A/events.json","paper":"https://pith.science/paper/ZN5POEXY"},"agent_actions":{"view_html":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A","download_json":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A.json","view_paper":"https://pith.science/paper/ZN5POEXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02335&json=true","fetch_graph":"https://pith.science/api/pith-number/ZN5POEXYXBBWLWBNGLFS7NBD4A/graph.json","fetch_events":"https://pith.science/api/pith-number/ZN5POEXYXBBWLWBNGLFS7NBD4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A/action/storage_attestation","attest_author":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A/action/author_attestation","sign_citation":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A/action/citation_signature","submit_replication":"https://pith.science/pith/ZN5POEXYXBBWLWBNGLFS7NBD4A/action/replication_record"}},"created_at":"2026-05-18T00:42:45.727749+00:00","updated_at":"2026-05-18T00:42:45.727749+00:00"}