{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QHBFUUIZDEKQRF3JGPVAOBB7RP","short_pith_number":"pith:QHBFUUIZ","schema_version":"1.0","canonical_sha256":"81c25a5119191508976933ea07043f8bf497138ce5193e767b6e30e629dd64b9","source":{"kind":"arxiv","id":"1511.01025","version":2},"attestation_state":"computed","paper":{"title":"Color-line and Proper Color-line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Florian Pfender, Van Bang Le","submitted_at":"2015-11-03T18:35:29Z","abstract_excerpt":"Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The (proper) color-line graph $C\\!L(H)$ of $H$ has edges of $H$ as vertices, and two edges of $H$ are adjacent in $C\\!L(H)$ if they are incident in $H$ or have the same color. We give Krausz-type characterizations for (proper) color-line graphs, and point out that, for any fixed $k\\ge 2$, recognizing if a graph is the color-line graph of some graph $H$ in which th"},"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":"1511.01025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-03T18:35:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f8bbfef7161a2ab2bfe34ce60076fdadfe21e679abccb72eca639e944f9c5250","abstract_canon_sha256":"680c2fe7f8cd362d225f5126fa8f920ff0291490c528bb610a6f55a277b8bff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:57.036629Z","signature_b64":"om6+BaxzYvWixmF9Qeh+dAfDvGHqWFttOOEczxsenFZmPJrRDg8IaHCCphd48JiNXq6DAwzddcjOVtmibcWWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c25a5119191508976933ea07043f8bf497138ce5193e767b6e30e629dd64b9","last_reissued_at":"2026-05-17T23:43:57.035820Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:57.035820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Color-line and Proper Color-line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Florian Pfender, Van Bang Le","submitted_at":"2015-11-03T18:35:29Z","abstract_excerpt":"Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The (proper) color-line graph $C\\!L(H)$ of $H$ has edges of $H$ as vertices, and two edges of $H$ are adjacent in $C\\!L(H)$ if they are incident in $H$ or have the same color. We give Krausz-type characterizations for (proper) color-line graphs, and point out that, for any fixed $k\\ge 2$, recognizing if a graph is the color-line graph of some graph $H$ in which th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01025","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":""},"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":"1511.01025","created_at":"2026-05-17T23:43:57.035955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01025v2","created_at":"2026-05-17T23:43:57.035955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01025","created_at":"2026-05-17T23:43:57.035955+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHBFUUIZDEKQ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHBFUUIZDEKQRF3J","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHBFUUIZ","created_at":"2026-05-18T12:29:37.295048+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/QHBFUUIZDEKQRF3JGPVAOBB7RP","json":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP.json","graph_json":"https://pith.science/api/pith-number/QHBFUUIZDEKQRF3JGPVAOBB7RP/graph.json","events_json":"https://pith.science/api/pith-number/QHBFUUIZDEKQRF3JGPVAOBB7RP/events.json","paper":"https://pith.science/paper/QHBFUUIZ"},"agent_actions":{"view_html":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP","download_json":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP.json","view_paper":"https://pith.science/paper/QHBFUUIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01025&json=true","fetch_graph":"https://pith.science/api/pith-number/QHBFUUIZDEKQRF3JGPVAOBB7RP/graph.json","fetch_events":"https://pith.science/api/pith-number/QHBFUUIZDEKQRF3JGPVAOBB7RP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP/action/storage_attestation","attest_author":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP/action/author_attestation","sign_citation":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP/action/citation_signature","submit_replication":"https://pith.science/pith/QHBFUUIZDEKQRF3JGPVAOBB7RP/action/replication_record"}},"created_at":"2026-05-17T23:43:57.035955+00:00","updated_at":"2026-05-17T23:43:57.035955+00:00"}