{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HZOPOFNJZ5CWVF7LD7LZO7LZ3O","short_pith_number":"pith:HZOPOFNJ","canonical_record":{"source":{"id":"1805.09586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T10:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"a6669c5f4663b4ea3000231b53b1c4caccb11755448c6fac1eb49be346ab7679","abstract_canon_sha256":"321693942220de6cc2c292476bbf1cf36371604c2de6b494ef791e0e69ab79de"},"schema_version":"1.0"},"canonical_sha256":"3e5cf715a9cf456a97eb1fd7977d79dba0d96d303a5b126953fc1489ce9f733c","source":{"kind":"arxiv","id":"1805.09586","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09586","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09586v3","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09586","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"pith_short_12","alias_value":"HZOPOFNJZ5CW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZOPOFNJZ5CWVF7L","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZOPOFNJ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HZOPOFNJZ5CWVF7LD7LZO7LZ3O","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09586","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T10:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"a6669c5f4663b4ea3000231b53b1c4caccb11755448c6fac1eb49be346ab7679","abstract_canon_sha256":"321693942220de6cc2c292476bbf1cf36371604c2de6b494ef791e0e69ab79de"},"schema_version":"1.0"},"canonical_sha256":"3e5cf715a9cf456a97eb1fd7977d79dba0d96d303a5b126953fc1489ce9f733c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:31.907995Z","signature_b64":"7VHBenXfttYFEY1CnfUjMKyfm01Eaky4pC4NEfRPuxh0iBKNo3D1RmgYOrzIduoFeogXQ9QGwIujQ2g54i5YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e5cf715a9cf456a97eb1fd7977d79dba0d96d303a5b126953fc1489ce9f733c","last_reissued_at":"2026-05-17T23:57:31.907547Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:31.907547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09586","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkZHwGTCwziW22ACxM0wRKJ/cEIvGxG6aXC5Zow5gF+REUGOfvWSNK4gmelIkjLCqj9qJuyG+qgjcQMXbKvUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:55:02.217301Z"},"content_sha256":"69a42213c6233b28fc6e516d03901cd8ce77f4561a05609a10fb906e8b62266f","schema_version":"1.0","event_id":"sha256:69a42213c6233b28fc6e516d03901cd8ce77f4561a05609a10fb906e8b62266f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HZOPOFNJZ5CWVF7LD7LZO7LZ3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi","submitted_at":"2018-05-24T10:12:11Z","abstract_excerpt":"A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of a graph $G$, is the smallest integer $k$ for which $G$ admits a star edge coloring with $k$ colors. In this paper, we present a polynomial time algorithm that finds an optimum star edge coloring for every tree. We also provide some tight bounds on the star chromatic index of trees with diameter at most four, and using these bounds we find a formula for the star chromatic index of certain families of trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09586","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFCRxA/qjDnarEO6X/4VUzgyBSDYIComK+dUGCT5P4qLVWmEW5JZEQI4zxpU/H78J1dOMsOhtKZd3LCjVHufBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:55:02.217665Z"},"content_sha256":"ff16763d81492f87b5bbe273d49b2e55bde77268b9c96d025136896dccf0d408","schema_version":"1.0","event_id":"sha256:ff16763d81492f87b5bbe273d49b2e55bde77268b9c96d025136896dccf0d408"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O/bundle.json","state_url":"https://pith.science/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T03:55:02Z","links":{"resolver":"https://pith.science/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O","bundle":"https://pith.science/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O/bundle.json","state":"https://pith.science/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZOPOFNJZ5CWVF7LD7LZO7LZ3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HZOPOFNJZ5CWVF7LD7LZO7LZ3O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"321693942220de6cc2c292476bbf1cf36371604c2de6b494ef791e0e69ab79de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T10:12:11Z","title_canon_sha256":"a6669c5f4663b4ea3000231b53b1c4caccb11755448c6fac1eb49be346ab7679"},"schema_version":"1.0","source":{"id":"1805.09586","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09586","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09586v3","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09586","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"pith_short_12","alias_value":"HZOPOFNJZ5CW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZOPOFNJZ5CWVF7L","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZOPOFNJ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:ff16763d81492f87b5bbe273d49b2e55bde77268b9c96d025136896dccf0d408","target":"graph","created_at":"2026-05-17T23:57:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of a graph $G$, is the smallest integer $k$ for which $G$ admits a star edge coloring with $k$ colors. In this paper, we present a polynomial time algorithm that finds an optimum star edge coloring for every tree. We also provide some tight bounds on the star chromatic index of trees with diameter at most four, and using these bounds we find a formula for the star chromatic index of certain families of trees.","authors_text":"Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T10:12:11Z","title":"A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09586","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:69a42213c6233b28fc6e516d03901cd8ce77f4561a05609a10fb906e8b62266f","target":"record","created_at":"2026-05-17T23:57:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"321693942220de6cc2c292476bbf1cf36371604c2de6b494ef791e0e69ab79de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T10:12:11Z","title_canon_sha256":"a6669c5f4663b4ea3000231b53b1c4caccb11755448c6fac1eb49be346ab7679"},"schema_version":"1.0","source":{"id":"1805.09586","kind":"arxiv","version":3}},"canonical_sha256":"3e5cf715a9cf456a97eb1fd7977d79dba0d96d303a5b126953fc1489ce9f733c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e5cf715a9cf456a97eb1fd7977d79dba0d96d303a5b126953fc1489ce9f733c","first_computed_at":"2026-05-17T23:57:31.907547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:31.907547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7VHBenXfttYFEY1CnfUjMKyfm01Eaky4pC4NEfRPuxh0iBKNo3D1RmgYOrzIduoFeogXQ9QGwIujQ2g54i5YAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:31.907995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09586","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69a42213c6233b28fc6e516d03901cd8ce77f4561a05609a10fb906e8b62266f","sha256:ff16763d81492f87b5bbe273d49b2e55bde77268b9c96d025136896dccf0d408"],"state_sha256":"8819e65916c52909bd393d0f4cecf12fe9af361df5648a292f7c1cabe5f84b23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ry3ciUOQxZScIHzbaC00wrz+pnQeyXxlJoixzG/IaRrILfs9Si3rYgi2nWeHKja+apsfu3N8vw2iDm8rUaZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:55:02.219579Z","bundle_sha256":"3ac9af971543f3d3e053dbc1f53b73ad267dd0a5617049cd0ea22e0718391532"}}