{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UQ5DE53BCEZG3HALLZ5QYXVYMZ","short_pith_number":"pith:UQ5DE53B","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"},"canonical_sha256":"a43a32776111326d9c0b5e7b0c5eb86654dcf03fb61bdc04d8bf833ea781eb45","source":{"kind":"arxiv","id":"1201.5340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5340","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5340v1","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5340","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"UQ5DE53BCEZG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UQ5DE53BCEZG3HAL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UQ5DE53B","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UQ5DE53BCEZG3HALLZ5QYXVYMZ","target":"record","payload":{"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"},"canonical_sha256":"a43a32776111326d9c0b5e7b0c5eb86654dcf03fb61bdc04d8bf833ea781eb45","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"},"source_kind":"arxiv","source_id":"1201.5340","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ktqRJYpSy0D/jmdk5rhDOSC6Y+5UAx/VTUgaSB7A2/6mN8SY6wHq+i1ZFCN7lYxMkqQowYgq/WWgeNSgdT+8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:38:48.114847Z"},"content_sha256":"78e754814dfcfab19049b1fff1df7fa82365fbb25c35adc66257e1c701f5128d","schema_version":"1.0","event_id":"sha256:78e754814dfcfab19049b1fff1df7fa82365fbb25c35adc66257e1c701f5128d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UQ5DE53BCEZG3HALLZ5QYXVYMZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPp5te3nCI2FQPuEpi1vNInhXGYYrGT2pP3onNnZC+o2cLmdH6rTT2ulUMkja0M/Z1tFnpqu7080uZFzbRdNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:38:48.115184Z"},"content_sha256":"189f2e4e305a7a4ebed444d2ba91627d3a1bb0051234459aa2a6dc4a94d29a7d","schema_version":"1.0","event_id":"sha256:189f2e4e305a7a4ebed444d2ba91627d3a1bb0051234459aa2a6dc4a94d29a7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/bundle.json","state_url":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T14:38:48Z","links":{"resolver":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ","bundle":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/bundle.json","state":"https://pith.science/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQ5DE53BCEZG3HALLZ5QYXVYMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UQ5DE53BCEZG3HALLZ5QYXVYMZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e196ae9d0f3ad9ed4a81087ee11747480592f7c468d5d53007be7965091c92c3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-25T18:54:11Z","title_canon_sha256":"4e860f9c17d514c4bd37fb33571c4f78b9cf792d7604d995c0b1b0e271a14d0f"},"schema_version":"1.0","source":{"id":"1201.5340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5340","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5340v1","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5340","created_at":"2026-05-18T04:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"UQ5DE53BCEZG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UQ5DE53BCEZG3HAL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UQ5DE53B","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:189f2e4e305a7a4ebed444d2ba91627d3a1bb0051234459aa2a6dc4a94d29a7d","target":"graph","created_at":"2026-05-18T04:03:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-25T18:54:11Z","title":"Rainbow Induced Subgraphs in Replication Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5340","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:78e754814dfcfab19049b1fff1df7fa82365fbb25c35adc66257e1c701f5128d","target":"record","created_at":"2026-05-18T04:03:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e196ae9d0f3ad9ed4a81087ee11747480592f7c468d5d53007be7965091c92c3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-01-25T18:54:11Z","title_canon_sha256":"4e860f9c17d514c4bd37fb33571c4f78b9cf792d7604d995c0b1b0e271a14d0f"},"schema_version":"1.0","source":{"id":"1201.5340","kind":"arxiv","version":1}},"canonical_sha256":"a43a32776111326d9c0b5e7b0c5eb86654dcf03fb61bdc04d8bf833ea781eb45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a43a32776111326d9c0b5e7b0c5eb86654dcf03fb61bdc04d8bf833ea781eb45","first_computed_at":"2026-05-18T04:03:55.014311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:55.014311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aa+1dvDuvMIjzHvDhAty5hxgdbfDu5wzwzOaze6f9cnb4tFMVcdc8BGAimiHZ8NAv4mExsioT9YTXZjgnDI5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:55.015136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78e754814dfcfab19049b1fff1df7fa82365fbb25c35adc66257e1c701f5128d","sha256:189f2e4e305a7a4ebed444d2ba91627d3a1bb0051234459aa2a6dc4a94d29a7d"],"state_sha256":"b3f857e2b16002b776be93153382294b1461ff5ee69699af3a75c0b3c1d55b13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yqz3PQLdIC0RxodtfS6CfVTQp27b2ZYYOi8vsg0YOQdMkoUo6LW+LPq8WVDrCs/SNHVODRRriv6UxXQdOz/IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:38:48.117089Z","bundle_sha256":"c91b4159d791e253be23e8849a781d8d1515cc1151b38f8c1ef6ce72477b5144"}}