{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RPEEMLTW7GMI3VDALLCNW43YJB","short_pith_number":"pith:RPEEMLTW","schema_version":"1.0","canonical_sha256":"8bc8462e76f9988dd4605ac4db7378486f69dd32d32b986b8f2fd8281128e8b9","source":{"kind":"arxiv","id":"1105.3712","version":1},"attestation_state":"computed","paper":{"title":"Rainbow induced subgraphs in proper vertex colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","submitted_at":"2011-05-18T18:33:00Z","abstract_excerpt":"For a given graph $H$ we define $\\rho(H)$ to be the minimum order of a graph $G$ such that every proper vertex coloring of $G$ contains a rainbow induced subgraph isomorphic to $H$. We give upper and lower bounds for $\\rho(H)$, compute the exact value for some classes of graphs, and consider an interesting combinatorial problem connected with computation of $\\rho(H)$ for paths. This research is motivated by some ideas in on-line graph coloring algorithms."},"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":"1105.3712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-18T18:33:00Z","cross_cats_sorted":[],"title_canon_sha256":"d1e9ecb7646461d2405ed127d2928d58e5440eefc8255d6a9bd8c6be099c6646","abstract_canon_sha256":"c5c13017d46b90d55be1d39a25812d38de44462d6580bbdf5c5a7092a40dac57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:52.037783Z","signature_b64":"LELluTW9vpMpffp5M6mpIZyuXp9yvs7ePQKtk1OltdUgnMRmOHERO/NWLtkjbZYutFHS5VkzIr0EXBSPpFP9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc8462e76f9988dd4605ac4db7378486f69dd32d32b986b8f2fd8281128e8b9","last_reissued_at":"2026-05-18T04:21:52.037102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:52.037102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow induced subgraphs in proper vertex colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","submitted_at":"2011-05-18T18:33:00Z","abstract_excerpt":"For a given graph $H$ we define $\\rho(H)$ to be the minimum order of a graph $G$ such that every proper vertex coloring of $G$ contains a rainbow induced subgraph isomorphic to $H$. We give upper and lower bounds for $\\rho(H)$, compute the exact value for some classes of graphs, and consider an interesting combinatorial problem connected with computation of $\\rho(H)$ for paths. This research is motivated by some ideas in on-line graph coloring algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3712","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":"1105.3712","created_at":"2026-05-18T04:21:52.037206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3712v1","created_at":"2026-05-18T04:21:52.037206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3712","created_at":"2026-05-18T04:21:52.037206+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPEEMLTW7GMI","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPEEMLTW7GMI3VDA","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPEEMLTW","created_at":"2026-05-18T12:26:41.206345+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/RPEEMLTW7GMI3VDALLCNW43YJB","json":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB.json","graph_json":"https://pith.science/api/pith-number/RPEEMLTW7GMI3VDALLCNW43YJB/graph.json","events_json":"https://pith.science/api/pith-number/RPEEMLTW7GMI3VDALLCNW43YJB/events.json","paper":"https://pith.science/paper/RPEEMLTW"},"agent_actions":{"view_html":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB","download_json":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB.json","view_paper":"https://pith.science/paper/RPEEMLTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3712&json=true","fetch_graph":"https://pith.science/api/pith-number/RPEEMLTW7GMI3VDALLCNW43YJB/graph.json","fetch_events":"https://pith.science/api/pith-number/RPEEMLTW7GMI3VDALLCNW43YJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB/action/storage_attestation","attest_author":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB/action/author_attestation","sign_citation":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB/action/citation_signature","submit_replication":"https://pith.science/pith/RPEEMLTW7GMI3VDALLCNW43YJB/action/replication_record"}},"created_at":"2026-05-18T04:21:52.037206+00:00","updated_at":"2026-05-18T04:21:52.037206+00:00"}