{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UQ5DE53BCEZG3HALLZ5QYXVYMZ","short_pith_number":"pith:UQ5DE53B","schema_version":"1.0","canonical_sha256":"a43a32776111326d9c0b5e7b0c5eb86654dcf03fb61bdc04d8bf833ea781eb45","source":{"kind":"arxiv","id":"1201.5340","version":1},"attestation_state":"computed","paper":{"title":"Rainbow Induced Subgraphs in Replication Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","submitted_at":"2012-01-25T18:54:11Z","abstract_excerpt":"A graph $G$ is called a replication graph of a graph $H$ if $G$ is obtained from $H$ by replacing vertices of $H$ by arbitrary cliques of vertices and then replacing each edge in $H$ by all the edges between corresponding cligues. For a given graph $H$ the $\\rho_R(H)$ is the minimal number of vertices of a replication graph $G$ of $H$ such that every proper vertex coloring of $G$ contains a rainbow induced subgraph isomorphic to $H$ having exactly one vertex in each replication clique of $G$. We prove some bounds for $\\rho_R$ for some classes of graphs and compute some exact values. Also some "},"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":"1201.5340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-25T18:54:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4e860f9c17d514c4bd37fb33571c4f78b9cf792d7604d995c0b1b0e271a14d0f","abstract_canon_sha256":"e196ae9d0f3ad9ed4a81087ee11747480592f7c468d5d53007be7965091c92c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:55.015136Z","signature_b64":"aa+1dvDuvMIjzHvDhAty5hxgdbfDu5wzwzOaze6f9cnb4tFMVcdc8BGAimiHZ8NAv4mExsioT9YTXZjgnDI5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a43a32776111326d9c0b5e7b0c5eb86654dcf03fb61bdc04d8bf833ea781eb45","last_reissued_at":"2026-05-18T04:03:55.014311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:55.014311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Induced Subgraphs in Replication Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","submitted_at":"2012-01-25T18:54:11Z","abstract_excerpt":"A graph $G$ is called a replication graph of a graph $H$ if $G$ is obtained from $H$ by replacing vertices of $H$ by arbitrary cliques of vertices and then replacing each edge in $H$ by all the edges between corresponding cligues. For a given graph $H$ the $\\rho_R(H)$ is the minimal number of vertices of a replication graph $G$ of $H$ such that every proper vertex coloring of $G$ contains a rainbow induced subgraph isomorphic to $H$ having exactly one vertex in each replication clique of $G$. We prove some bounds for $\\rho_R$ for some classes of graphs and compute some exact values. Also some "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5340","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":"1201.5340","created_at":"2026-05-18T04:03:55.014461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5340v1","created_at":"2026-05-18T04:03:55.014461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5340","created_at":"2026-05-18T04:03:55.014461+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQ5DE53BCEZG","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQ5DE53BCEZG3HAL","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQ5DE53B","created_at":"2026-05-18T12:27:23.164592+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/UQ5DE53BCEZG3HALLZ5QYXVYMZ","json":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ.json","graph_json":"https://pith.science/api/pith-number/UQ5DE53BCEZG3HALLZ5QYXVYMZ/graph.json","events_json":"https://pith.science/api/pith-number/UQ5DE53BCEZG3HALLZ5QYXVYMZ/events.json","paper":"https://pith.science/paper/UQ5DE53B"},"agent_actions":{"view_html":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ","download_json":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ.json","view_paper":"https://pith.science/paper/UQ5DE53B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5340&json=true","fetch_graph":"https://pith.science/api/pith-number/UQ5DE53BCEZG3HALLZ5QYXVYMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UQ5DE53BCEZG3HALLZ5QYXVYMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/action/storage_attestation","attest_author":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/action/author_attestation","sign_citation":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/action/citation_signature","submit_replication":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/action/replication_record"}},"created_at":"2026-05-18T04:03:55.014461+00:00","updated_at":"2026-05-18T04:03:55.014461+00:00"}