{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:24PH22JQQKGXDEYTA2AJBVYJQT","short_pith_number":"pith:24PH22JQ","canonical_record":{"source":{"id":"2409.10899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-09-17T05:29:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"10cf44df2c7520b1453d4b5c104870093617b9767063d739cb4b4c6f14c8b65e","abstract_canon_sha256":"43f4987115992b25aca5d330504a37281a0cbe2d6842110649bb4605a7e7d1f6"},"schema_version":"1.0"},"canonical_sha256":"d71e7d6930828d719313068090d70984fc43f3a6de9175a72229c5867f2105d6","source":{"kind":"arxiv","id":"2409.10899","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10899","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10899v2","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10899","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"pith_short_12","alias_value":"24PH22JQQKGX","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"pith_short_16","alias_value":"24PH22JQQKGXDEYT","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"pith_short_8","alias_value":"24PH22JQ","created_at":"2026-07-05T09:10:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:24PH22JQQKGXDEYTA2AJBVYJQT","target":"record","payload":{"canonical_record":{"source":{"id":"2409.10899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-09-17T05:29:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"10cf44df2c7520b1453d4b5c104870093617b9767063d739cb4b4c6f14c8b65e","abstract_canon_sha256":"43f4987115992b25aca5d330504a37281a0cbe2d6842110649bb4605a7e7d1f6"},"schema_version":"1.0"},"canonical_sha256":"d71e7d6930828d719313068090d70984fc43f3a6de9175a72229c5867f2105d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:50.574906Z","signature_b64":"9+e/3zGp55tyUPg/QEZVTH4TH9qIInUJa9cl9bqo6i+TPEc97uu5PJT5RnayuA0R9KFWQBTLqbSGmPR3CHe8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d71e7d6930828d719313068090d70984fc43f3a6de9175a72229c5867f2105d6","last_reissued_at":"2026-07-05T09:10:50.574256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:50.574256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.10899","source_version":2,"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-07-05T09:10:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5hgU5P8qgB+aHMsBYb6as5urCoFSDbV7iwR21jYtCemUe1BVY4sDBmAyH01XplnITraQ50vc6in+QsGYiFhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T03:18:24.874036Z"},"content_sha256":"1373340d01764f39f4750e7982b530c207f9e9eb6f8f180466bb83810ea3577c","schema_version":"1.0","event_id":"sha256:1373340d01764f39f4750e7982b530c207f9e9eb6f8f180466bb83810ea3577c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:24PH22JQQKGXDEYTA2AJBVYJQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict-free chromatic index of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ethan Y.H. Li, Luyi Li, Ping Li, Shanshan Guo","submitted_at":"2024-09-17T05:29:49Z","abstract_excerpt":"A graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ such that $G$ is conflict-free $k$-edge-colorable is called the conflict-free chromatic index of $G$, denoted $\\chi'_{CF}(G)$. D\\c{e}bski and Przyby\\a{l}o showed that $2\\le\\chi'_{CF}(T)\\le 3$ for every tree $T$ of size at least two. In this paper, we present an algorithm to determine the conflict-free chromatic index of a tree without 2-degree verti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10899","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/2409.10899/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"},"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-07-05T09:10:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tka0Im6orMWyk/0KZMmnl/TMoPZOG/fUwJUUaZSHJbQm4vQkpvyUqa0bNIdacALguPfx2BH9BoN6+xisNU1sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T03:18:24.874638Z"},"content_sha256":"ff1d7cfa274d15e1960fd4ba4de1c4505963469ebf023b4a378615a0547aea37","schema_version":"1.0","event_id":"sha256:ff1d7cfa274d15e1960fd4ba4de1c4505963469ebf023b4a378615a0547aea37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24PH22JQQKGXDEYTA2AJBVYJQT/bundle.json","state_url":"https://pith.science/pith/24PH22JQQKGXDEYTA2AJBVYJQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24PH22JQQKGXDEYTA2AJBVYJQT/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-08-22T03:18:24Z","links":{"resolver":"https://pith.science/pith/24PH22JQQKGXDEYTA2AJBVYJQT","bundle":"https://pith.science/pith/24PH22JQQKGXDEYTA2AJBVYJQT/bundle.json","state":"https://pith.science/pith/24PH22JQQKGXDEYTA2AJBVYJQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24PH22JQQKGXDEYTA2AJBVYJQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:24PH22JQQKGXDEYTA2AJBVYJQT","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":"43f4987115992b25aca5d330504a37281a0cbe2d6842110649bb4605a7e7d1f6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-09-17T05:29:49Z","title_canon_sha256":"10cf44df2c7520b1453d4b5c104870093617b9767063d739cb4b4c6f14c8b65e"},"schema_version":"1.0","source":{"id":"2409.10899","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10899","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10899v2","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10899","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"pith_short_12","alias_value":"24PH22JQQKGX","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"pith_short_16","alias_value":"24PH22JQQKGXDEYT","created_at":"2026-07-05T09:10:50Z"},{"alias_kind":"pith_short_8","alias_value":"24PH22JQ","created_at":"2026-07-05T09:10:50Z"}],"graph_snapshots":[{"event_id":"sha256:ff1d7cfa274d15e1960fd4ba4de1c4505963469ebf023b4a378615a0547aea37","target":"graph","created_at":"2026-07-05T09:10:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.10899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ such that $G$ is conflict-free $k$-edge-colorable is called the conflict-free chromatic index of $G$, denoted $\\chi'_{CF}(G)$. D\\c{e}bski and Przyby\\a{l}o showed that $2\\le\\chi'_{CF}(T)\\le 3$ for every tree $T$ of size at least two. In this paper, we present an algorithm to determine the conflict-free chromatic index of a tree without 2-degree verti","authors_text":"Ethan Y.H. Li, Luyi Li, Ping Li, Shanshan Guo","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-09-17T05:29:49Z","title":"Conflict-free chromatic index of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10899","kind":"arxiv","version":2},"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:1373340d01764f39f4750e7982b530c207f9e9eb6f8f180466bb83810ea3577c","target":"record","created_at":"2026-07-05T09:10:50Z","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":"43f4987115992b25aca5d330504a37281a0cbe2d6842110649bb4605a7e7d1f6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-09-17T05:29:49Z","title_canon_sha256":"10cf44df2c7520b1453d4b5c104870093617b9767063d739cb4b4c6f14c8b65e"},"schema_version":"1.0","source":{"id":"2409.10899","kind":"arxiv","version":2}},"canonical_sha256":"d71e7d6930828d719313068090d70984fc43f3a6de9175a72229c5867f2105d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d71e7d6930828d719313068090d70984fc43f3a6de9175a72229c5867f2105d6","first_computed_at":"2026-07-05T09:10:50.574256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:10:50.574256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9+e/3zGp55tyUPg/QEZVTH4TH9qIInUJa9cl9bqo6i+TPEc97uu5PJT5RnayuA0R9KFWQBTLqbSGmPR3CHe8CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:10:50.574906Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10899","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1373340d01764f39f4750e7982b530c207f9e9eb6f8f180466bb83810ea3577c","sha256:ff1d7cfa274d15e1960fd4ba4de1c4505963469ebf023b4a378615a0547aea37"],"state_sha256":"4824d60d4c7e1003851ee0eaeba0f3705d4fbc71231183c0229b91bb07e2352b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sV3NAGjKiJWcFatozCsiC/uxeS1GQMoaPQVNOV9CRqzUG5qffHrRQhovczSOZ4jKjHD59bELklhdncbUe9JjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T03:18:24.879603Z","bundle_sha256":"6ea09a5d1d9f74208334beb93e9326b01f08a00520187ee59fff760aec12f1ed"}}