{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IH4FXNJT42WCPLXBWDYFQNYT7R","short_pith_number":"pith:IH4FXNJT","schema_version":"1.0","canonical_sha256":"41f85bb533e6ac27aee1b0f0583713fc5930b049836cbafaccc611614c5e3833","source":{"kind":"arxiv","id":"1902.04828","version":1},"attestation_state":"computed","paper":{"title":"On the achromatic number of signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Dimitri Lajou (LaBRI, UB)","submitted_at":"2019-02-13T10:03:26Z","abstract_excerpt":"In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove that computing any of them is NP-complete."},"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":"1902.04828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T10:03:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1e84846e13c382aeca6c644a9829d030033b2fbd8e9d4f7e022444584857787f","abstract_canon_sha256":"63de30b6d243f4a4f07656eeb1ed9a251d8ecc13f39bb62d2c0429d479361c23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:05.821474Z","signature_b64":"DYVIRo/zPwRvsl58CtxdEDzVqjAgByWq7Zz66H0vKN8cRUkWiZEqtV5J2HBkFytEFGscwaxTwNAHUDoLOmrTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f85bb533e6ac27aee1b0f0583713fc5930b049836cbafaccc611614c5e3833","last_reissued_at":"2026-05-17T23:54:05.821027Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:05.821027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the achromatic number of signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Dimitri Lajou (LaBRI, UB)","submitted_at":"2019-02-13T10:03:26Z","abstract_excerpt":"In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove that computing any of them is NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04828","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":"1902.04828","created_at":"2026-05-17T23:54:05.821091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04828v1","created_at":"2026-05-17T23:54:05.821091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04828","created_at":"2026-05-17T23:54:05.821091+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH4FXNJT42WC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH4FXNJT42WCPLXB","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH4FXNJT","created_at":"2026-05-18T12:33:18.533446+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/IH4FXNJT42WCPLXBWDYFQNYT7R","json":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R.json","graph_json":"https://pith.science/api/pith-number/IH4FXNJT42WCPLXBWDYFQNYT7R/graph.json","events_json":"https://pith.science/api/pith-number/IH4FXNJT42WCPLXBWDYFQNYT7R/events.json","paper":"https://pith.science/paper/IH4FXNJT"},"agent_actions":{"view_html":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R","download_json":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R.json","view_paper":"https://pith.science/paper/IH4FXNJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04828&json=true","fetch_graph":"https://pith.science/api/pith-number/IH4FXNJT42WCPLXBWDYFQNYT7R/graph.json","fetch_events":"https://pith.science/api/pith-number/IH4FXNJT42WCPLXBWDYFQNYT7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R/action/storage_attestation","attest_author":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R/action/author_attestation","sign_citation":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R/action/citation_signature","submit_replication":"https://pith.science/pith/IH4FXNJT42WCPLXBWDYFQNYT7R/action/replication_record"}},"created_at":"2026-05-17T23:54:05.821091+00:00","updated_at":"2026-05-17T23:54:05.821091+00:00"}