{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ML4TFR3IYAFN4N3CJJDCQD23E5","short_pith_number":"pith:ML4TFR3I","schema_version":"1.0","canonical_sha256":"62f932c768c00ade37624a46280f5b27463377585dd2e3a3724167d3f84f91ae","source":{"kind":"arxiv","id":"1510.02626","version":1},"attestation_state":"computed","paper":{"title":"Injective Edge Chromatic Index of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles Dominic, Domingos M. Cardoso, J. Orestes Cerdeira, J. Pedro Cruz","submitted_at":"2015-10-09T10:54:21Z","abstract_excerpt":"Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of length three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if $e_{1}, e_{2}$ and $e_{3}$ are consecutive edges in $G$, then $c(e_{1})\\neq c(e_3)$. The injective edge coloring number $\\chi_{i}^{'}(G)$ is the minimum number of colors permitted in such a coloring. In this paper, exact values of $\\chi_{i}^{'}(G)$ for several classes of graphs are obtained, upper and lower bounds for $\\chi_{i}^{'}(G)$ are introduced and it is pr"},"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":"1510.02626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-09T10:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"ca597e9436f988f66bfd709543393fdd830bc9e00df577c3e0debc8b04d72632","abstract_canon_sha256":"717722b8f327aad0cab9059d98d577e3a5654dac68ab916365743b43f9ab0903"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:41.884898Z","signature_b64":"nhYM4U/5QpuQPf8y/44rDMEa1ysdkB77v9UaGdg6wvYD7jKbCxNVmWluhd9GesM4a/wc7ma/f/Ie5lga82HgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62f932c768c00ade37624a46280f5b27463377585dd2e3a3724167d3f84f91ae","last_reissued_at":"2026-05-18T01:30:41.884372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:41.884372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Injective Edge Chromatic Index of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles Dominic, Domingos M. Cardoso, J. Orestes Cerdeira, J. Pedro Cruz","submitted_at":"2015-10-09T10:54:21Z","abstract_excerpt":"Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of length three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if $e_{1}, e_{2}$ and $e_{3}$ are consecutive edges in $G$, then $c(e_{1})\\neq c(e_3)$. The injective edge coloring number $\\chi_{i}^{'}(G)$ is the minimum number of colors permitted in such a coloring. In this paper, exact values of $\\chi_{i}^{'}(G)$ for several classes of graphs are obtained, upper and lower bounds for $\\chi_{i}^{'}(G)$ are introduced and it is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02626","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":"1510.02626","created_at":"2026-05-18T01:30:41.884454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02626v1","created_at":"2026-05-18T01:30:41.884454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02626","created_at":"2026-05-18T01:30:41.884454+00:00"},{"alias_kind":"pith_short_12","alias_value":"ML4TFR3IYAFN","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"ML4TFR3IYAFN4N3C","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"ML4TFR3I","created_at":"2026-05-18T12:29:32.376354+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/ML4TFR3IYAFN4N3CJJDCQD23E5","json":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5.json","graph_json":"https://pith.science/api/pith-number/ML4TFR3IYAFN4N3CJJDCQD23E5/graph.json","events_json":"https://pith.science/api/pith-number/ML4TFR3IYAFN4N3CJJDCQD23E5/events.json","paper":"https://pith.science/paper/ML4TFR3I"},"agent_actions":{"view_html":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5","download_json":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5.json","view_paper":"https://pith.science/paper/ML4TFR3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02626&json=true","fetch_graph":"https://pith.science/api/pith-number/ML4TFR3IYAFN4N3CJJDCQD23E5/graph.json","fetch_events":"https://pith.science/api/pith-number/ML4TFR3IYAFN4N3CJJDCQD23E5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5/action/storage_attestation","attest_author":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5/action/author_attestation","sign_citation":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5/action/citation_signature","submit_replication":"https://pith.science/pith/ML4TFR3IYAFN4N3CJJDCQD23E5/action/replication_record"}},"created_at":"2026-05-18T01:30:41.884454+00:00","updated_at":"2026-05-18T01:30:41.884454+00:00"}