{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EFGVQYEB26J3ZF7PDBZTH5FSAU","short_pith_number":"pith:EFGVQYEB","schema_version":"1.0","canonical_sha256":"214d586081d793bc97ef187333f4b2050d4d0781d711736eddab53515fd150e2","source":{"kind":"arxiv","id":"1511.06782","version":3},"attestation_state":"computed","paper":{"title":"Pseudoachromatic and connected-pseudoachromatic indices of the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Rubio-Montiel, G. Araujo-Pardo","submitted_at":"2015-11-20T21:47:30Z","abstract_excerpt":"A complete $k$-coloring of a graph $G$ is a (not necessarily proper) $k$-coloring of the vertices of $G$, such that each pair of different colors appears in an edge. A complete $k$-coloring is also called connected, if each color class induces a connected subgraph of $G$. The pseudoachromatic index of a graph $G$, denoted by $\\psi'(G)$, is the largest $k$ for which the line graph of $G$ has a complete $k$-coloring. Analogously the connected-pseudoachromatic index of $G$, denoted by $\\psi_c'(G)$, is the largest $k$ for which the line graph of $G$ has a connected and complete $k$-coloring.\n  In "},"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.06782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-20T21:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"c28a36266441644d53dd52f1cd996880712f768df58a55178e01376c34bf1553","abstract_canon_sha256":"02e136c5941e7576b861e3ba3006c9589fb16a17df63a4966d293c6f5693b69e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:34.393808Z","signature_b64":"x8KOHWdywHgfeTlZcMpPXRQAkaxI1W4zYqlIvKUppL3C1JOnplXfEKYF7yQfLwsuzei9cjVAeZcRQeppN0FwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"214d586081d793bc97ef187333f4b2050d4d0781d711736eddab53515fd150e2","last_reissued_at":"2026-05-18T00:04:34.393102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:34.393102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudoachromatic and connected-pseudoachromatic indices of the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Rubio-Montiel, G. Araujo-Pardo","submitted_at":"2015-11-20T21:47:30Z","abstract_excerpt":"A complete $k$-coloring of a graph $G$ is a (not necessarily proper) $k$-coloring of the vertices of $G$, such that each pair of different colors appears in an edge. A complete $k$-coloring is also called connected, if each color class induces a connected subgraph of $G$. The pseudoachromatic index of a graph $G$, denoted by $\\psi'(G)$, is the largest $k$ for which the line graph of $G$ has a complete $k$-coloring. Analogously the connected-pseudoachromatic index of $G$, denoted by $\\psi_c'(G)$, is the largest $k$ for which the line graph of $G$ has a connected and complete $k$-coloring.\n  In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06782","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06782","created_at":"2026-05-18T00:04:34.393199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06782v3","created_at":"2026-05-18T00:04:34.393199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06782","created_at":"2026-05-18T00:04:34.393199+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFGVQYEB26J3","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFGVQYEB26J3ZF7P","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFGVQYEB","created_at":"2026-05-18T12:29:19.899920+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/EFGVQYEB26J3ZF7PDBZTH5FSAU","json":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU.json","graph_json":"https://pith.science/api/pith-number/EFGVQYEB26J3ZF7PDBZTH5FSAU/graph.json","events_json":"https://pith.science/api/pith-number/EFGVQYEB26J3ZF7PDBZTH5FSAU/events.json","paper":"https://pith.science/paper/EFGVQYEB"},"agent_actions":{"view_html":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU","download_json":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU.json","view_paper":"https://pith.science/paper/EFGVQYEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06782&json=true","fetch_graph":"https://pith.science/api/pith-number/EFGVQYEB26J3ZF7PDBZTH5FSAU/graph.json","fetch_events":"https://pith.science/api/pith-number/EFGVQYEB26J3ZF7PDBZTH5FSAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU/action/storage_attestation","attest_author":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU/action/author_attestation","sign_citation":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU/action/citation_signature","submit_replication":"https://pith.science/pith/EFGVQYEB26J3ZF7PDBZTH5FSAU/action/replication_record"}},"created_at":"2026-05-18T00:04:34.393199+00:00","updated_at":"2026-05-18T00:04:34.393199+00:00"}