{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KLH5M7NEQLF5OSB37HB5B7Y46C","short_pith_number":"pith:KLH5M7NE","schema_version":"1.0","canonical_sha256":"52cfd67da482cbd7483bf9c3d0ff1cf095cbdf4818dfb7081b6f382e14538f77","source":{"kind":"arxiv","id":"1601.06920","version":1},"attestation_state":"computed","paper":{"title":"Vertex Colorings without Rainbow or Monochromatic Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Honghai Xu, Wayne Goddard","submitted_at":"2016-01-26T08:28:31Z","abstract_excerpt":"This paper investigates vertex colorings of graphs such that some rainbow subgraph~$R$ and some monochromatic subgraph $M$ are forbidden. Previous work focussed on the case that $R=M$. Here we consider the more general case, especially the case that $M=K_2$."},"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":"1601.06920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-26T08:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"31a26235bf589edb1111c495870d61cacc4264f81e03f8fd20288df37b05b900","abstract_canon_sha256":"390f962f41911fdd6dc14ee9cb2cfbb3b92a0db39ea6897df71401d0a736a461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.526637Z","signature_b64":"u3+Z5K9IXxFfFQcob34J4X4XRMJk+x7C49+bxdVZq6lrFW0gSFzTUm4tnUpgwO3Oufei5mo9jKcBGF80bB7xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52cfd67da482cbd7483bf9c3d0ff1cf095cbdf4818dfb7081b6f382e14538f77","last_reissued_at":"2026-05-18T01:21:59.525922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.525922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Colorings without Rainbow or Monochromatic Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Honghai Xu, Wayne Goddard","submitted_at":"2016-01-26T08:28:31Z","abstract_excerpt":"This paper investigates vertex colorings of graphs such that some rainbow subgraph~$R$ and some monochromatic subgraph $M$ are forbidden. Previous work focussed on the case that $R=M$. Here we consider the more general case, especially the case that $M=K_2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06920","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":"1601.06920","created_at":"2026-05-18T01:21:59.526027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06920v1","created_at":"2026-05-18T01:21:59.526027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06920","created_at":"2026-05-18T01:21:59.526027+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLH5M7NEQLF5","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLH5M7NEQLF5OSB3","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLH5M7NE","created_at":"2026-05-18T12:30:25.849896+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/KLH5M7NEQLF5OSB37HB5B7Y46C","json":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C.json","graph_json":"https://pith.science/api/pith-number/KLH5M7NEQLF5OSB37HB5B7Y46C/graph.json","events_json":"https://pith.science/api/pith-number/KLH5M7NEQLF5OSB37HB5B7Y46C/events.json","paper":"https://pith.science/paper/KLH5M7NE"},"agent_actions":{"view_html":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C","download_json":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C.json","view_paper":"https://pith.science/paper/KLH5M7NE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06920&json=true","fetch_graph":"https://pith.science/api/pith-number/KLH5M7NEQLF5OSB37HB5B7Y46C/graph.json","fetch_events":"https://pith.science/api/pith-number/KLH5M7NEQLF5OSB37HB5B7Y46C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C/action/storage_attestation","attest_author":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C/action/author_attestation","sign_citation":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C/action/citation_signature","submit_replication":"https://pith.science/pith/KLH5M7NEQLF5OSB37HB5B7Y46C/action/replication_record"}},"created_at":"2026-05-18T01:21:59.526027+00:00","updated_at":"2026-05-18T01:21:59.526027+00:00"}